New Lower Bounds for Cap Sets

DOI10.19086/DA.91076MaRDI QIDQ6411424zbMATH OpenFDO

Authors Fred Tyrrell

Publication date 20 September 2022

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

Mathematics Subject Classification ID

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

Abstract: 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$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved computational methods and new theoretical ideas to show that, for large enough $n$, there is always a cap set in $mathbb{F}_3^n$ of size at least $2.218^n$.

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 Q6411424)