Fetching the paper…
Reading the bibliography…
A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$.
1907
Earlier work this paper cites.
Giuseppe Pellegrino, Sul massimo ordine delle calotte in S 4 , 3 S_{4,3} , Matematiche (Catania) 25
1970
Earlier work this paper cites.
A. Robert Calderbank and Peter C. Fishburn, Maximal three-independent subsets of { 0 , 1 , 2 } n \{0,1,2\}^{n} , Designs, Codes and Cryptography 4
1994
Earlier work this paper cites.
Roy Meshulam, On subsets of finite abelian groups with no 3-term arithmetic progressions , Journal of Combinatorial Theory, Series A 71
1995
Earlier work this paper cites.
Yves Edel, Sandy Ferret, Ivan Landjev, and Leo Storme, The classification of the largest caps in A G AG ( 5 , 3 ) (5,3) , Journal of Combinatorial Theory, Series A 99
2002
Earlier work this paper cites.
2007
Earlier work this paper cites.
Aaron Potechin, Maximal caps in AG ( 6 , 3 ) (6,3) , Designs, Codes and Cryptography 46
2008
Cited alongside, same era.
Michael Bateman and Nets Katz, New bounds on cap sets , Journal of the American Mathematical Society 25
2012
Cited alongside, same era.
Ernie Croot, Vsevolod F. Lev, and Péter Pál Pach, Progression-free sets in ℤ 4 n \mathbb{Z}_{4}^{n} are exponentially small , Annals of Mathematics 185
2017
Cited alongside, same era.
Jordan S. Ellenberg and Dion Gijswijt, On large subsets of 𝔽 q n \mathbb{F}_{q}^{n} with no three-term arithmetic progression , Annals of Mathematics 185
2017
Cited alongside, same era.
Joshua Grochow, New applications of the polynomial method: the cap set conjecture and beyond , Bulletin of the American Mathematical Society 56
2019
Cited alongside, same era.
2021
Later among the works it cites.
Yves Edel, Yves Edel’s webpage , https://www.mathi.uni-heidelberg.de/~yves/Matritzen/CAPs/Is/Iindex.html , Accessed: 19-09-2022
2022
Closest in time.
Terence Tao, A symmetric formulation of the Croot-Lev-Pach-Ellenberg-Gijswijt capset bound , https://terrytao.wordpress.com , 2016, Accessed: 19-09-2022
2022
Closest in time.
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Armin Biere, Katalin Fazekas, Mathias Fleury, and Maximillian Heisinger, CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020 , Proc. of SAT Competition 2020 – Solver and Benchmark Descriptions (Tomas Balyo, Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, and Martin Suda, eds.), Department of Computer Science Report Series B, vol. B-2020-1, University of Helsinki, 2020, pp. 51–53
2020
Cited alongside, same era.
2023
Closest in time.