A finite version of the Kakeya problem
Abstract
Let be a set of lines of an affine space over a field and let be a set of points with the property that every line of is incident with at least points of . Let be the set of directions of the lines of considered as points of the projective space at infinity. We give a geometric construction of a set of lines , where contains an grid and where has size , given a starting configuration in the plane. We provide examples of such starting configurations for the reals and for finite fields. Following Dvir's proof of the finite field Kakeya conjecture and the idea of using multiplicities of Dvir, Kopparty, Saraf and Sudan, we prove a lower bound on the size of dependent on the ideal generated by the homogeneous polynomials vanishing on . This bound is maximised as plus smaller order terms, for , when contains the points of a grid.
Keywords
Cite
@article{arxiv.1503.06639,
title = {A finite version of the Kakeya problem},
author = {Simeon Ball and Aart Blokhuis and Diego Domenzain},
journal= {arXiv preprint arXiv:1503.06639},
year = {2016}
}
Comments
A few minor changes to previous version