Fetching the paper…
Reading the bibliography…
In Ellenberg and Gijswijt's groundbreaking work, the authors show that a subset of $\mathbb{Z}_3^{n}$ with no arithmetic progression of length 3 must be of size at most $2.755^n$ (no prior upper bound was known of $(3-\epsilon)^n)$), and provide for any prime $p$ a value $\lambda_p<p$ such that any subset of $\mathbb{Z}_p^{n}$ with no arithmetic progression of length 3 must be of size at most $\lambda_p^n$.
On cap sets and the group-theoretic approach to matrix multiplication
Jonah Blasiak, Thomas Church, Henry Cohn, Joshua A. Grochow, Eric Naslund, William F. Sawin, and Chris Umans · 2017
Earlier work this paper cites.
Progression-free sets in ℤ 4 n \mathbb{Z}_{4}^{n} are exponentially small
Ernie Croot, Vsevolod Lev and Peter Pach · 2017
Earlier work this paper cites.
On large subsets of F q n F_{q}^{n} with no three-term arithmetic progression
Jordan S. Ellenberg and Dion Gijswijt · 2017
Cited alongside, same era.
The growth rate of tri-colored sum-free sets (preprint)
Robert Kleinberg, William F. Sawin, and David E. Speyer · 2017
Cited alongside, same era.
The growth rate of tri-colored sum-free sets
Robert Kleinberg, William F. Sawin, and David E. Speyer · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…