Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 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

On Roth's theorem on progressions (1011.0104v3)

Published 30 Oct 2010 in math.CA and math.NT

Abstract: We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.

Summary

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