A note on Elkin's improvement of Behrend's construction
Ben Green, Julia Wolf
TL;DR
This paper offers a concise proof of Elkin's recent result on constructing large 3-term progression-free subsets of integers from 1 to N, advancing understanding in additive combinatorics.
Contribution
It provides a simplified proof of Elkin's construction method for large progression-free sets, clarifying the underlying techniques.
Findings
Constructs large 3-term progression-free subsets of integers
Simplifies the proof of Elkin's recent result
Enhances understanding of additive combinatorics methods
Abstract
We provide a short proof of a recent result of Elkin in which large subsets of the integers 1 up to N free of 3-term progressions are constructed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.