On the size of Kakeya sets in finite vector spaces
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.