On the size of Kakeya sets in finite fields
Author:
- Zeev DvirZDZeev Dvir
Top Cited Papers
Open Access
- 23 June 2008
- journal article
- Published by American Mathematical Society (AMS) in Journal of the American Mathematical Society
- Vol. 22 (4) , 1093-1097
Abstract
A Kakeya set is a subset of F n \mathbb {F}^n , where F \mathbb {F} is a finite field of q 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 C_{n} \cdot q^{n} , where C n C_{n} depends only on n n . This answers a question of Wolff.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- A new bound for finite field Besicovitch sets in four dimensionsPacific Journal of Mathematics, 2005
- A sum-product estimate in finite fields, and applicationsGeometric and Functional Analysis, 2004
- Restriction and Kakeya phenomena for finite fieldsDuke Mathematical Journal, 2004
- Recent work connected with the Kakeya problem2003
- The Finite Field Kakeya ProblemThe American Mathematical Monthly, 2001
- On diffusion in high-dimensional Hamiltonian systems and PDEJournal d'Analyse Mathématique, 2000
- On the Dimension of Kakeya Sets and Related Maximal InequalitiesGeometric and Functional Analysis, 1999
- Bounds on arithmetic projections, and applications to the Kakeya conjectureMathematical Research Letters, 1999
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Some remarks on the Kakeya problemMathematical Proceedings of the Cambridge Philosophical Society, 1971