Improved lower bound on the size of Kakeya sets over finite fields
Shubhangi Saraf, Madhu Sudan · Analysis & PDE · 2008
In a recent breakthrough, Dvir showed that every Kakeya set in ކ n must have cardinality at least c n |ކ| n , where c n ≈ 1/n!.We improve this lower bound to β n |ކ| n for a constant β > 0. This pins down the correct growth of the constant c n as a function of n (up to the determination of β).