The Finite Field Kakeya Problem
From MaRDI portal
Abstract: A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds for n greater than 4.
Cited in
(17)- Small Kakeya sets in non-prime order planes
- On bisecants of Rédei type blocking sets and applications
- On Segre's lemma of tangents
- On the intersection distribution of degree three polynomials and related topics
- A note on large Kakeya sets
- Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics
- Intersection distribution, non-hitting index and Kakeya sets in affine planes
- The Kakeya problem: a gap in the spectrum and classification of the smallest examples
- On minimal Besicovitch arrangements in \(\mathbb{F}_q^2\): statistical properties and combinatorial implications
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- On the stability of sets of even type
- Sharp density bounds on the finite field Kakeya problem
- On sets of points with few odd secants
- Kakeya sets in finite affine spaces
- Minimal d-hyperplane arrangement for the general case in AG(n, q) and PG(n, q)
- Permutations minimizing the number of collinear triples
- Intersection distribution of degree four polynomials over finite fields
This page was built for publication: The Finite Field Kakeya Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601921)
