Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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

Logarithmic bounds for Roth's theorem via almost-periodicity (1810.12791v2)

Published 30 Oct 2018 in math.CO and math.NT

Abstract: We give a new proof of logarithmic bounds for Roth's theorem on arithmetic progressions, namely that if $A \subset {1,2,\ldots,N}$ is free of three-term progressions, then $\lvert A\rvert \leq N/(\log N){1-o(1)}$. Unlike previous proofs, this is almost entirely done in physical space using almost-periodicity.

Summary

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