On sets of integers not containing long arithmetic progressions
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 2k+1. This extends a result of Behrend (1946) concerning sets which do not contain aritmetic progressions of length 3.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.