Roth's Theorem is a foundational result in combinatorial number theory that asserts any subset of the integers with positive upper density contains infinitely many arithmetic progressions of length three, thereby establishing the first non-trivial case of Szemerédi's theorem.
74
Publications
2.7K
Citations
91
Authors
90
Institutions
Publications per year
2017–2026
8
Parents
Publications
74
On Roth’s Theorem on Progressions
2011 · 163 citations
Ben Green · Annals of Mathematics · 2005 · 162 citations · Full text
Simultaneous approximation to algebraic numbers by rationals
Wolfgang M. Schmidt · Acta Mathematica · 1970 · 146 citations · Full text
1–5 of 74
Authors
91
- VB
4
h-index
- SP
3
h-index
- RM
2
h-index
- SP
2
h-index
- JB
2
h-index
1–5 of 91
Institutions
90
University of Bristol
Bristol, United Kingdom
4 h-index
4 publications
112 citations
The Ohio State University
Columbus, United States
3 h-index
5 publications
208 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
55 citations
University of Georgia
Athens, United States
2 h-index
2 publications
28 citations
Stanford University
Stanford, United States
2 h-index
2 publications
53 citations
Brigham Young University
Provo, United States
2 h-index
2 publications
40 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
2 publications
119 citations
Scuola Normale Superiore
Pisa, Italy
2 h-index
2 publications
188 citations
1–8 of 90
Venues
- Mathematika
5 publications · 109 citations
5
h-index
- Inventiones mathematicae
5 publications · 211 citations
5
h-index
- Linear Algebra and its Applications
4 publications · 122 citations
4
h-index
- Mathematical Proceedings of the Cambridge Philosophical Society
3 publications · 87 citations
3
h-index
- Annals of Mathematics
3 publications · 302 citations
3
h-index
1–5