Improved lower bound on the size of Kakeya sets over finite fields
Abstract
In a recent breakthrough, Dvir showed that every Kakeya set in n must be of cardinality at least cn ||n where cn ≈ 1/n!. We improve this lower bound to βn ||n for a constant β > 0. This pins down the growth of the leading constant to the right form as a function of n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.