Improved lower bound on the size of Kakeya sets over finite fields
classification
🧮 math.CO
keywords
betaboundconstantkakeyalowerapproxbreakthroughcardinality
read the original abstract
In a recent breakthrough, Dvir showed that every Kakeya set in $\F^n$ must be of cardinality at least $c_n |\F|^n$ where $c_n \approx 1/n!$. We improve this lower bound to $\beta^n |\F|^n$ for a constant $\beta > 0$. This pins down the growth of the leading constant to the right form as a function of $n$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.