An improved lower bound on the size of Kakeya sets over finite fields
From MaRDI portal
Publication:841571
DOI10.2140/apde.2008.1.375zbMath1335.42017arXiv0808.2499OpenAlexW2963096774MaRDI QIDQ841571
Publication date: 17 September 2009
Published in: Analysis \& PDE (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.2499
Maximal functions, Littlewood-Paley theory (42B25) Combinatorial aspects of finite geometries (05B25)
Related Items (25)
Proof of the Kakeya set conjecture over rings of integers modulo square-free N ⋮ Book review of: L. Guth, Polynomial methods in combinatorics ⋮ Finite Field Kakeya and Nikodym Sets in Three Dimensions ⋮ On the size of Kakeya sets in finite vector spaces ⋮ Kakeya sets in finite affine spaces ⋮ The Kakeya conjecture on local fields of positive characteristic ⋮ The constant of point-line incidence constructions ⋮ An algebraic geometry version of the Kakeya problem ⋮ Joints tightened ⋮ Sharp density bounds on the finite field Kakeya problem ⋮ Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof ⋮ Kakeya-type sets in finite vector spaces ⋮ Variants of the Kakeya problem over an algebraically closed field ⋮ Unnamed Item ⋮ The Spherical Kakeya Problem in Finite Fields ⋮ Kakeya configurations in Lie groups and homogeneous spaces ⋮ The Kakeya problem: a gap in the spectrum and classification of the smallest examples ⋮ Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants ⋮ Probabilities of incidence between lines and a plane curve over finite fields ⋮ Unnamed Item ⋮ A note on large Kakeya sets ⋮ The small Kakeya sets in T2*(C), C a conic ⋮ Conical Kakeya and Nikodym sets in finite fields ⋮ High-rate codes with sublinear-time decoding ⋮ Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
This page was built for publication: An improved lower bound on the size of Kakeya sets over finite fields
