Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 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

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\,.$$

Summary

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