A Kakeya set in Rd is a bounded set which contains a unit line segment in every direction. Such sets can have measure zero, but the Kakeya conjecture posits that they always have (Minkowski and Hausdorff) dimension d. It remains open for d≥4.
A related conjecture is the arithmetic Kakeya conjecture, which can be formulated as stating that a property, AK(⋅) holds of a real number α. It is trivial that AK(2) holds. The arithmetic Kakeya conjecture is that AK(1) holds, and this is known to imply the Kakeya conjecture. The current state-of-the-art is AK(γ) where γ≈1.675 is the largest root of x3−4x+2.
Due to work of Katz and Tao, it is possible to establish AK(α) for particular values of α by constructing certain finite, combinatorial objects. This method is responsible for the current state-of-the-art result. The goal of this problem is to improve on that, i.e. to exhibit such an object that establishes AK(α) for α<γ. There are limits known to this method: it cannot work for α<23. Thus, this problem cannot establish the full Kakeya conjecture.
See the write-up for full definitions and additional background.
This machinery also facilitates posing a problem asking for an improved upper bound on the sum-difference constant. The best-known bound is 11/6 and any improvement is probably at least moderately interesting.
Read more here.