Sharp density bounds on the finite field Kakeya problem
Boris Bukh, Ting-Wei Chao

TL;DR
This paper establishes a lower bound on the density of Kakeya sets in finite fields, matching known constructions, and advancing understanding of their minimal size in finite field geometry.
Contribution
It provides a sharp density lower bound for Kakeya sets in finite fields, confirming the optimality of existing constructions.
Findings
Kakeya sets in finite fields have density at least 1/2^{n-1}
The bound matches the known explicit constructions
Advances understanding of geometric configurations in finite fields
Abstract
A Kakeya set in is a set containing a line in every direction. We show that every Kakeya set in has density at least , matching the construction by Dvir, Kopparty, Saraf and Sudan.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
