Faber's lower-bound conjecture for Kakeya sets in odd-order projective planes
Faber's lower-bound conjecture for Kakeya sets in odd-order projective planes
Let be a projective plane of odd order , and let be a Kakeya set in , meaning that contains at least one point on each line of a fixed line pencil. Faber's conjecture. Every Kakeya set satisfies
For even , the corresponding lower bound is attained by the construction from a dual hyperoval; when is odd, the conjectured bound is motivated by the absence of hyperovals and by the associated construction from a dual oval. The conjecture was raised and studied by X. W. C. Faber; the supplied text does not establish whether it has been resolved.
Sources & referencesView supporting material
Primary source
Aart Blokhuis and Francesco Mazzocca, “The Finite Field Kakeya Problem”, arXiv:0911.4370 (2009).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.