On Roth's theorem on progressions
Author:
Top Cited Papers
Open Access
- 1 July 2011
- journal article
- Published by Annals of Mathematics in Annals of Mathematics
- Vol. 174 (1) , 619-636
Abstract
We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.Comment: 16 pp. Corrected the proof of the Croot-Sisask Lemma. Corrected typos. Updated referenceKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- On arithmetic progressions in sums of sets of integers2012
- A Probabilistic Technique for Finding Almost-Periods of ConvolutionsGeometric and Functional Analysis, 2010
- A Note on Elkin’s Improvement of Behrend’s Construction2010
- The true complexity of a system of linear equationsProceedings of the London Mathematical Society, 2009
- Roth’s theorem on progressions revisitedJournal d'Analyse Mathématique, 2008
- Roth’s theorem in the primesAnnals of Mathematics, 2005
- A polynomial bound in Freiman's theoremDuke Mathematical Journal, 2002
- On Triples in Arithmetic ProgressionGeometric and Functional Analysis, 1999
- Integer Sets Containing No Arithmetic ProgressionsJournal of the London Mathematical Society, 1987
- On Sets of Integers Which Contain No Three Terms in Arithmetical ProgressionProceedings of the National Academy of Sciences, 1946