Progression-free sets in Z_4^n are exponentially small
Ernie Croot, Vsevolod Lev, and Peter Pach

TL;DR
This paper proves that subsets of Z_4^n avoiding three-term arithmetic progressions are exponentially small relative to the size of the entire space, with a specific exponential bound.
Contribution
It establishes a new exponential upper bound on the size of progression-free sets in Z_4^n, improving understanding of their structure.
Findings
Progression-free sets in Z_4^n are exponentially small.
The size of such sets is less than 4^{0.926 n}.
Provides a quantitative bound on progression-free subsets.
Abstract
We show that for integer , any subset free of three-term arithmetic progressions has size , with an absolute constant .
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Analytic Number Theory Research
