Proof of the Kakeya set conjecture over rings of integers modulo square-free $N$
Manik Dhar, Zeev Dvir

TL;DR
This paper proves a lower bound on the size of Kakeya sets over square-free integers modulo N, extending known results from prime moduli to composite square-free cases, and reduces the problem to rank bounds over finite fields.
Contribution
It establishes the first nontrivial lower bounds for Kakeya sets over composite square-free moduli, generalizing previous prime-only results, and links the problem to incidence matrix rank over finite fields.
Findings
Lower bound of $C_{n, ext{epsilon}} N^{n - ext{epsilon}}$ for Kakeya sets over square-free N
Reduction of the problem to bounding the rank of incidence matrices over finite fields
Extension of Kakeya set bounds from prime to square-free composite moduli
Abstract
A Kakeya set is a set containing a line in each direction. We show that, when is any square-free integer, the size of the smallest Kakeya set in is at least for any -- resolving a special case of a conjecture of Hickman and Wright. Previously, such bounds were only known for the case of prime . We also show that the case of general can be reduced to lower bounding the rank of the incidence matrix of points and hyperplanes over .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
