Finite-plane Besicovitch set cardinality conjecture
For an odd prime power , a Besicovitch set in is a subset containing a line in every direction. Finite-plane Besicovitch set conjecture. The smallest Besicovitch set in has cardinality
Every such set has cardinality at least , while the source describes a construction attaining the displayed upper bound. The conjecture gives the exact minimum in the finite plane for odd prime powers.
References
Primary source
Joshua N. Cooper, “Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem”, arXiv:math/0607734 (2006).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.