On the size of Kakeya sets in finite vector spaces
Combinatorics
2013-02-25 v1
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.
Cite
@article{arxiv.1302.5591,
title = {On the size of Kakeya sets in finite vector spaces},
author = {Gohar Kyureghyan and Peter Müller and Qi Wang},
journal= {arXiv preprint arXiv:1302.5591},
year = {2013}
}