AI-assisted work finds smaller sticky Kakeya set over F3 than classical construction
Researchers at Munim, Inc. report an explicit 30-point sticky Kakeya set in F_3^4, one point smaller than the classical 31-point construction. A colour-lifting step extends this to sticky sets of size 31 * 2^(n-4) - 1 for every n >= 4, so the classical set is minimal only up to dimension 3. Whether the best growth rate for sticky sets stays at 2 remains unresolved, and the authors have narrowed the search to tree structures of height at least 5. The best known lower bound for sticky sets is about 1.905^n. The results have not yet been checked by independent mathematicians, and the authors invite corrections.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.


Discussion (0)
Log in to join the discussion and vote.
Log in