The Finite Field Kakeya Problem
A Besicovitch set in AG(n, q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds for n>4.
Unable to display preview. Download preview PDF.
- Z. Dvir, On the Size of Kakeya Sets in Finite Fields, J. of the AMS (to appear), (2008).Google Scholar
- J. Cooper, Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem, Arxiv preprint, math.CO/0607734, (2006) — arxiv.org.Google Scholar
- T. Wolff, Recent Work Connected with the Kakeya Problem, Prospects in Matematics (Princeton, NJ, 1996), Amer. Math. Soc., Providence, RI, (1999), 129–162.Google Scholar