Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions (2007.03528v2)

Published 7 Jul 2020 in math.NT and math.CO

Abstract: We show that if $A\subset {1,\ldots,N}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N){1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a conjecture of Erd\H{o}s on arithmetic progressions.

Citations (47)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com