On the size of Kakeya sets in finite vector spaces
classification
🧮 math.CO
keywords
kakeyafinitesetssizeboundscontainsderivesdirection
read the original abstract
For a finite field GF(q) a Kakeya set K is a subset of GF(q)^n that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.
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.