A Van der Waerden-free proof of Rado's theorem
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911274559864832 |
|---|---|
| author | Di Nasso, Mauro Baglini, Lorenzo Luperi |
| author_facet | Di Nasso, Mauro Baglini, Lorenzo Luperi |
| contents | We present a proof of the sufficiency of Rado's condition for the partition regularity of linear Diophantine equations that avoids any use of van der Waerden's theorem. The proof is based on fundamental properties that are common knowledge in combinatorics of numbers and is entirely elementary, with the sole exception of a standard application of the compactness principle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_14660 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Van der Waerden-free proof of Rado's theorem Di Nasso, Mauro Baglini, Lorenzo Luperi Combinatorics We present a proof of the sufficiency of Rado's condition for the partition regularity of linear Diophantine equations that avoids any use of van der Waerden's theorem. The proof is based on fundamental properties that are common knowledge in combinatorics of numbers and is entirely elementary, with the sole exception of a standard application of the compactness principle. |
| title | A Van der Waerden-free proof of Rado's theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.14660 |