2000 character limit reached
Improved bound in Roth's theorem on arithmetic progressions
Published 3 May 2020 in math.NT | (2005.01145v1)
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\,.$$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
