| Front for the arXiv | |||
| |||
| arXiv:0803.2336 |
![[pdf]](/images/buttons/pdf.png)
![[ps]](/images/buttons/ps.png)
![[dvi]](/images/buttons/dvi.png)
![[src]](/images/buttons/src.png)
![[arxiv]](/images/buttons/arxiv.png)
Title: On the size of Kakeya sets in finite fields
Authors: Zeev Dvir
Categories: math.CO Combinatorics (math.CA Classical Analysis and ODEs; math.NT Number Theory)
Comments: Improved bound and added references
MSC: 52C17
Abstract: A Kakeya set is a subset of F^n, where F is a finite field of q elements,
that contains a line in every direction. In this paper we show that the size of
every Kakeya set is at least C_n * q^n, where C_n depends only on n. This
improves the previously best lower bound for general n of ~q^{4n/7}.
Owner: Zeev Dvir
Version 1: Sun, 16 Mar 2008 16:31:49 GMT
Version 2: Wed, 19 Mar 2008 14:21:30 GMT
Version 3: Thu, 20 Mar 2008 21:31:23 GMT
![[help e-mail]](/images/help.png)
- for questions or comments about the FrontarXiv contact page - for questions about downloading and submitting e-prints |