Mathematics – Combinatorics
Scientific paper
2009-11-23
Building Bridges Between Mathematics and Computer Science, Bolyai Society Mathematical Studies, Vol.19, 2008
Mathematics
Combinatorics
13 pages
Scientific paper
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.
Blokhuis Aart
Mazzocca Francesco
No associations
LandOfFree
The Finite Field Kakeya Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Finite Field Kakeya Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Finite Field Kakeya Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-173136