Improved bound in Roth's theorem on arithmetic progressions

2020/05/03 by Schoen, Tomasz
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2005.01145

Abstract

We prove that if A⊆ \1,…,N\ does not contain any non-trivial three-term arithmetic progression, then |A|≪ \frac(loglog N)^3+o(1)log NN .

Related

• Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions
• Strong Bounds for 3-Progressions
• An improvement to the Kelley-Meka bounds on three-term arithmetic progressions
• Short Note: Every Large Set of Integers Contains a Three Term Arithmetic Progression
• Improving Roth's theorem in the primes