Popular progression differences in vector spaces II
Jacob Fox, Huy Tuan Pham

TL;DR
This paper investigates the size of vector spaces needed to guarantee the existence of three-term arithmetic progressions with a certain density, extending previous results with precise tower height bounds for large primes.
Contribution
It determines the tower height of the minimal dimension for arithmetic progression density guarantees in vector spaces over finite fields, refining bounds for large primes.
Findings
For primes p ≥ 19, the tower height of n_p(α,β) is characterized up to a constant factor.
When β=α^3/2, the required dimension is a tower of twos with height proportional to (log p)(log log(1/α)).
Different regions of α and β require different bounds and arguments to estimate the tower height.
Abstract
Green used an arithmetic analogue of Szemer\'edi's celebrated regularity lemma to prove the following strengthening of Roth's theorem in vector spaces. For every , , and prime number , there is a least positive integer such that if , then for every subset of of density at least there is a nonzero for which the density of three-term arithmetic progressions with common difference is at least . We determine for the tower height of up to an absolute constant factor and an additive term depending only on . In particular, if we want half the random bound (so ), then the dimension required is a tower of twos of height . It turns out that the tower height in general takes on…
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 · Advanced Graph Theory Research
