An improvement to the Kelley-Meka bounds on three-term arithmetic progressions

F. A. Behrend “On sets of integers which contain no three terms in arithmetical progression” Proc. Nat. Acad. Sci. U. S. A

1946

Earlier work this paper cites.

G.A. Freiman, H. Halberstam, and I.Z. Ruzsa “Integer sum sets containing long arithmetic progressions” J. London Math. Soc

1992

Earlier work this paper cites.

T. Tao and V. Vu “Additive Combinatorics” Cambridge University Press

2006

Earlier work this paper cites.

T. F. Bloom and O. Sisask “Breaking the logarithmic barrier in Roth’s theorem on arithmetic progressions” submitted

Original

2007

Earlier work this paper cites.

B. Green and J. Wolf, “A note on Elkin’s improvement of Behrend’s construction” Additive number theory, 141–144, Springer, New York, 2010

2010

Cited alongside, same era.

M. Elkin, “An improved construction of progression-free sets” Israel J. Math

2011

Cited alongside, same era.

T. Sanders “On the Bogolyubov-Ruzsa lemma” Anal. PDE

2012

Cited alongside, same era.

T. F. Bloom and O. Sisask “The Kelley-Meka bounds for sets free of three-term arithmetic progressions” arXiv 2302.07211

Cited in the paper.

Z. Hunter and C. Pohoata, “A note on off-diagonal Ramsey numbers for vector spaces over 𝔽 2 \mathbb{F}_{2} .”, arXiv

Cited in the paper.

Z. Kelley and R. Meka, “Strong bounds for 3 3 -progressions”, arXiv:2302.05537

Original

Cited in the paper.

T. Schoen and O. Sisask “Roth’s theorem for four variables and additive structures in sums of sparse sets” Forum Math. Sigma

2016

Later among the works it cites.

E. Croot and V. Lev and P. Pach “Progression-free sets in ℤ 4 n \mathbb{Z}_{4}^{n} are exponentially small” Ann. of Math

2017

Later among the works it cites.

J. S. Ellenberg and D. Gijswijt. “On large subsets of 𝔽 q n \mathbb{F}^{n}_{q} with no three-term arithmetic progression” Ann. of Math

2017

Later among the works it cites.