Improved lower bound on the size of Kakeya sets over finite fields
| dc.creator | Saraf, Shubhangi | |
| dc.creator | Sudan, Madhu | |
| dc.date | 2008-08-18 | |
| dc.date | 2008-08-22 | |
| dc.date.accessioned | 2026-07-07T09:57:37Z | |
| dc.date.available | 2026-07-07T09:57:37Z | |
| dc.description | 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 $β^n |\F|^n$ for a constant $β> 0$. This pins down the growth of the leading constant to the right form as a function of $n$. | |
| dc.description | 4 pages, Appendix with upper bound added | |
| dc.identifier | https://arxiv.org/abs/0808.2499 | |
| dc.identifier | http://arxiv.org/abs/0808.2499 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167410 | |
| dc.subject | Combinatorics | |
| dc.title | Improved lower bound on the size of Kakeya sets over finite fields | |
| dc.type | text |