New lower bounds for cap sets

DOI10.19086/DA.91076MaRDI QIDQ6962331zbMATH OpenFDO

Authors Fred Tyrrell

Publication date 8 July 2025

Published in Discrete Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.19086/DA.91076

zbMATH Keywords

arithmetic progressionscap setsfinite fieldSAT solver

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75)

Review text

A cap set is a subset of \(\mathbb{F}_{3}^{n}\) with no three-terms arithmetic progression formed by distinct elements. In this paper the author proves that there is a cap set in \(\mathbb{F}_{3}^{56232}\) of size\N\[\N\binom{11}{7}^{141}\cdot 6^{572}\cdot 12^{572}\cdot 112^{8800}\cdot 37\cdot 142.\N\]\NAs a corollary, he gets that for large \(n\), there is a cap set in \(\mathbb{F}_{3}^{n}\) of size \(2.218021^{n}\). The proof is based on a construction of Edel, which is based on the work of \textit{A. R. Calderbank} and \textit{P. C. Fishburn} [Des. Codes Cryptography 4, No. 3, 203--211 (1994; Zbl 0803.51016)]. The author applies new computational methods as well, which use a SAT solver. \N\NRecently, the estimation for the size of a cap set in \(\mathbb{F}_{3}^{n}\) was improved upon by B. Romera-Paredes et al to \(2.2202^{n}\) and as far as I know, this was improved upon by Naslund to \(2.2208^{n}\).

Cited in

(4)

• Greedy capsets
• Complete 3-term arithmetic progression free sets of small size in vector spaces and other abelian groups
• Maximal line-free sets in \(\mathbb{F}_p^n\)
• Algebraic capsets

This page was built for publication: New lower bounds for cap sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962331)