On sets of integers not containing long arithmetic progressions
classification
🧮 math.CO
math.NT
keywords
progressionsarithmeticcontainlengthsetsaritmeticbehrendcardinality
read the original abstract
We construct subsets of {1,...,N} of cardinality at least N exp(-C(log N)^{1/(k+1)}) which do not contain arithmetic progressions of length 2^k+1. This extends a result of Behrend (1946) concerning sets which do not contain aritmetic progressions of length 3.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.