On Roth's theorem on progressions

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.

16 pp. Corrected the proof of the Croot-Sisask Lemma. Corrected typos. Updated references

Cited by in corpus (9)

• A quantitative improvement for Roth's theorem on arithmetic progressions
• Additive dimension and a theorem of Sanders
• On Improving Roth's Theorem in the Primes
• A New Lower Bound for van der Waerden Numbers
• The Kelley--Meka bounds for sets free of three-term arithmetic progressions
• An arithmetic transference proof of a relative Szemerédi theorem
• Arithmetic progressions in sets of small doubling
• The Equidistant Dimension of Graphs
• Sparse graph counting and Kelley-Meka bounds for binary systems