An improved lower bound on the size of Kakeya sets over finite fields

DOI10.2140/APDE.2008.1.375zbMATH Open1335.42017arXiv0808.2499OpenAlexW2963096774MaRDI QIDQ841571FDOQ841571

Authors: Shubhangi Saraf, Madhu Sudan 

Publication date: 17 September 2009

Published in: Analysis \& PDE (Search for Journal in Brave)

Abstract: 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}approx1/n!$. We improve this lower bound to $$ for a constant $$. This pins down the growth of the leading constant to the right form as a function of $n$.

Full work available at URL: https://arxiv.org/abs/0808.2499

Recommendations

• Sharp density bounds on the finite field Kakeya problem
• On the size of Kakeya sets in finite fields
• Kakeya-type sets in finite vector spaces
• The Finite Field Kakeya Problem
• A finite version of the Kakeya problem

zbMATH Keywords

finite fieldspolynomial methodKakeya set

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Maximal functions, Littlewood-Paley theory (42B25)

Cited In (31)

• Joints tightened
• On the size of Kakeya sets in finite vector spaces
• Kakeya-type sets in finite vector spaces
• Conical Kakeya and Nikodym sets in finite fields
• Gröbner bases for increasing sequences
• Finite field Kakeya and Nikodym sets in three dimensions
• The Kakeya conjecture on local fields of positive characteristic
• The Finite Field Kakeya Problem
• Kakeya configurations in Lie groups and homogeneous spaces
• A new bound for finite field Besicovitch sets in four dimensions
• Size of local finite field Kakeya sets
• Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
• High-rate codes with sublinear-time decoding
• Book review of: L. Guth, Polynomial methods in combinatorics
• Variants of the Kakeya problem over an algebraically closed field
• Kakeya sets in finite affine spaces
• Proof of the Kakeya set conjecture over rings of integers modulo square-free \(N\)
• Title not available (Why is that?)
• Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof
• Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
• The small Kakeya sets in \(T_2^\ast(\mathcal{C})\), \(\mathcal{C}\) a conic
• Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
• Simple proofs for Furstenberg sets over finite fields
• On the finite field Kakeya problem in two dimensions
• An algebraic geometry version of the Kakeya problem
• A note on large Kakeya sets
• The spherical Kakeya problem in finite fields
• Sharp density bounds on the finite field Kakeya problem
• The constant of point-line incidence constructions
• The Kakeya problem: a gap in the spectrum and classification of the smallest examples
• Probabilities of incidence between lines and a plane curve over finite fields

This page was built for publication: An improved lower bound on the size of Kakeya sets over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841571)