Preprint
Aug 2026
Lower Bounds for Linear Hashing via Arithmetic Kakeya
It is shown that, for sufficiently large $p, the expected maximum loads in the modular and real settings are essentially the same, giving an alternative route to an $n^{1/3+o(1)}$ upper bound, and the Kakeya conjecture for upper Minkowski dimension is proved.
Ainesh Bakshi, A. Conway, Hanna Komlós et al.
· 1 citation