BibTeX
@ARTICLE{Dvir08onthe,
author = {Zeev Dvir},
title = {On the size of Kakeya sets in finite fields},
journal = {J. AMS},
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A Kakeya set is a subset of � n, where � 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 Cn · q n, where Cn depends only on n. This answers a question of Wolff [Wol99]. 1.
Citations
| 324 | Fast Probabilistic Algorithms for Verification of Polynomial Identities - Schwartz - 1980 |
| 55 | Recent work connected with the Kakeya problem - Wolff - 1996 |
| 39 | A sum-product estimate in finite fields, and applications. Geometric and Functional Analysis - Bourgain, Katz, et al. |
| 36 | private communication - Alon - 1993 |
| 18 | Bounds on arithmetic projections, and applications to the Kakeya conjecture - Katz, Tao - 1999 |
| 16 | From rotating needles to stability of waves: emerging connections between combinatorics, analysis - Tao |
| 15 | Tao,Restriction and Kakeya phenomena for finite fields - Mockenhaupt, T |
| 13 | Harmonic analysis and combinatorics: How much may they contribute to each other?, Mathematics: Frontiers and perspectives, IMU/Amer - Bourgain |
| 10 | Some remarks on the Kakeya problem - Davies - 1971 |
| 5 | A new bound for finite field Besicovitch sets in four dimensions - Tao |
| 4 | The finite field Kakeya problem - Rogers |
