A new proof of Roth’s theorem on arithmetic progressions
Open Access
- 4 November 2008
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 137 (03) , 805-809
Abstract
We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs of Roth's theorem), we do not pass to a progression related to the large Fourier coefficients of our set (as most other proofs of Roth do). Furthermore, in our proof, the density increment is achieved through an application of a quantitative version of Varnavides's theorem, which is perhaps unexpected.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- An old new proof of Roth’s theorem2007
- On Triples in Arithmetic ProgressionGeometric and Functional Analysis, 1999
- Integer sets containing no arithmetic progressionsActa Mathematica Hungarica, 1990
- Integer Sets Containing No Arithmetic ProgressionsJournal of the London Mathematical Society, 1987
- On Certain Sets of Positive DensityJournal of the London Mathematical Society, 1959
- On Certain Sets of IntegersJournal of the London Mathematical Society, 1953