Open Access
2008 An improved lower bound on the size of Kakeya sets over finite fields
Shubhangi Saraf, Madhu Sudan
Anal. PDE 1(3): 375-379 (2008). DOI: 10.2140/apde.2008.1.375

Abstract

In a recent breakthrough, Dvir showed that every Kakeya set in Fn must have cardinality at least cn|F|n, where cn1n!. We improve this lower bound to βn|F|n for a constant β>0. This pins down the correct growth of the constant cn as a function of n (up to the determination of β).

Citation

Download Citation

Shubhangi Saraf. Madhu Sudan. "An improved lower bound on the size of Kakeya sets over finite fields." Anal. PDE 1 (3) 375 - 379, 2008. https://doi.org/10.2140/apde.2008.1.375

Information

Received: 22 August 2008; Revised: 23 September 2008; Accepted: 22 October 2008; Published: 2008
First available in Project Euclid: 20 December 2017

MathSciNet: MR2490295
zbMATH: 1335.42017
Digital Object Identifier: 10.2140/apde.2008.1.375

Subjects:
Primary: 52C17
Secondary: 05B25

Keywords: finite fields , Kakeya set , polynomial method

Rights: Copyright © 2008 Mathematical Sciences Publishers

Vol.1 • No. 3 • 2008
MSP
Back to Top