The Finite Field Kakeya Problem
Combinatorics
2009-11-24 v1
Abstract
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 greater than 4.
Keywords
Cite
@article{arxiv.0911.4370,
title = {The Finite Field Kakeya Problem},
author = {Aart Blokhuis and Francesco Mazzocca},
journal= {arXiv preprint arXiv:0911.4370},
year = {2009}
}
Comments
13 pages