The Finite Field Kakeya Problem
classification
🧮 math.CO
keywords
kakeyaproblembesicovitchboundscontainingdeterminedirectionevery
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.