The Kakeya problem: A gap in the spectrum and classification of the smallest examples
Abstract
Kakeya sets in the affine plane AG (2,q) are point sets that are the union of lines, one through every point on the line at infinity. The finite field Kakeya problem asks for the size of the smallest Kakeya sets and the classification of these Kakeya sets. In this article we present a new example of a small Kakeya set and we give the classification of the smallest Kakeya sets up to weight q(q+2)/2+q/4, both in case q even. © 2013 Springer Science+Business Media New York.
Publication Title
Designs, Codes, and Cryptography
Recommended Citation
Blokhuis, A., De Boeck, M., Mazzocca, F., & Storme, L. (2014). The Kakeya problem: A gap in the spectrum and classification of the smallest examples. Designs, Codes, and Cryptography, 72 (1), 21-31. https://doi.org/10.1007/s10623-012-9790-3
