2000 character limit reached
On Roth's theorem on progressions
Published 30 Oct 2010 in math.CA and math.NT | (1011.0104v3)
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.
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.