New Lower Bounds for Cap Sets

20 Sep 2022  ·  Fred Tyrrell ·

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$.

PDF Abstract
No code implementations yet. Submit your code now

Categories


Combinatorics Discrete Mathematics Number Theory 11B25, 11B30, 11B75