Improved lower bound on the size of Kakeya sets over finite fields

In a recent breakthrough, Dvir showed that every Kakeya set in $\F^n$ must be of cardinality at least $c_n |\F|^n$ where $c_n \approx 1/n!$. We improve this lower bound to $\beta^n |\F|^n$ for a constant $\beta > 0$. This pins down the growth of the leading constant to the right form as a function of $n$.

[1]  J. Keller,et al.  Eulerian number asymptotics , 1994, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[2]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[3]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[4]  Terence Tao,et al.  Restriction and Kakeya phenomena for finite fields , 2002 .

[5]  Jean-Luc Marichal,et al.  Slices, Slabs, and Sections of the Unit Hypercube , 2006 .

[6]  Thomas Wolff,et al.  Recent work connected with the Kakeya problem , 2007 .

[7]  Zeev Dvir,et al.  On the size of Kakeya sets in finite fields , 2008, 0803.2336.