New lower bounds for r3(N)
Abstract
We develop recent ideas of Elsholtz, Proske, and Sauermann to construct denser subsets of \1,…,N\ that lack arithmetic progressions of length 3. This gives the first quasipolynomial improvement since the original construction of Behrend.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.