2000 character limit reached
Improved bound in Roth's theorem on arithmetic progressions (2005.01145v1)
Published 3 May 2020 in math.NT
Abstract: We prove that if $A\subseteq {1,\dots,N}$ does not contain any non-trivial three-term arithmetic progression, then $$|A|\ll \frac{(\log\log N){3+o(1)}}{\log N}N\,.$$