Arithmetic Kakeya Sets | Combinatorics

• An arithmetic Kakeya set is a finite set of points in a discrete ring that contains a complete arithmetic progression for every specified set of differences.
• The study of arithmetic Kakeya sets intersects with additive combinatorics, finite ring geometry, entropy inequalities, and fractal dimension theory.
• These sets are significant in understanding the Euclidean Kakeya problem, finite geometric configurations, and have applications in linear hashing and information theory.

Arithmetic Kakeya sets are discrete sets that contain a prescribed one-dimensional configuration in every direction. In the finite-field setting, a Kakeya set $K\subseteq \mathbb F_q^n$ contains a complete affine line in every direction and is required to have large cardinality. In the integer setting, an arithmetic Kakeya set is a finite set containing a $k$-term arithmetic progression for every common difference in a specified range. These formulations are related to finite-ring geometry, additive combinatorics, entropy inequalities, fractal dimension, finite geometric incidence theory, and, through discretization, the Euclidean Kakeya problem.

1. Definitions and principal models

Let $F=\mathbb F_q$ and $F^n$ be $n$-dimensional affine space. For $y,x\in F^n$, the affine line through $y$ in direction $x$ is

$L_{y,x}=\{y+ax:a\in F\}.$

A direction is a vector $x\in F^n$; nonzero scalar multiples determine the same geometric direction, so directions may equivalently be represented by points of $k$0. A finite-field Kakeya set, also called a finite-field Besicovitch set, is a subset $k$1 satisfying

$k$2

The zero direction is vacuous. The finite-field problem asks for lower bounds on $k$3, ideally of order $k$4, the size of the ambient space. Dvir’s polynomial method established this order of magnitude, and the quantitative bound

$k$5

is available in the finite-field setting (Dhar et al., 2020).

Over non-archimedean local rings, a line in $k$6, with $k$7 or $k$8, is

$k$9

A Kakeya set contains an entire line in every nonzero direction. In $F=\mathbb F_q$0, directions divisible by $F=\mathbb F_q$1 are redundant because

$F=\mathbb F_q$2

Thus reduced directions, whose coordinates are not all divisible by $F=\mathbb F_q$3, suffice. In dimension two, every reduced direction has a representative of the form $F=\mathbb F_q$4 or $F=\mathbb F_q$5, with $F=\mathbb F_q$6 (Dummit et al., 2011).

The integer arithmetic Kakeya problem is formulated using

$F=\mathbb F_q$7

Equivalently, for each $F=\mathbb F_q$8, there must exist $F=\mathbb F_q$9 such that

$F^n$0

The arithmetic Kakeya conjecture is

$F^n$1

A variant $F^n$2 requires $F^n$3-term progressions with $F^n$4 distinct common differences, not necessarily the prescribed differences $F^n$5. The two formulations have the same double-logarithmic asymptotics, since

$F^n$6

and $F^n$7 (Green et al., 2017).

2. Finite-field polynomial methods

The first polynomial-method lower bound for finite-field Kakeya sets proceeds through homogeneous polynomials. A $F^n$8-Kakeya set $F^n$9 is one for which a set $n$0 of at least $n$1 directions has, in each relevant direction, a line intersecting $n$2 in at least $n$3 points. Define

$n$4

Then

$n$5

For an ordinary Kakeya set, $n$6, so $n$7 and

$n$8

which has order $n$9 (0803.2336).

The proof assumes that $y,x\in F^n$0 is smaller than the dimension of the vector space of homogeneous degree-$y,x\in F^n$1 polynomials,

$y,x\in F^n$2

Dimension counting then produces a nonzero homogeneous polynomial $y,x\in F^n$3 vanishing on $y,x\in F^n$4. Homogeneity implies

$y,x\in F^n$5

so $y,x\in F^n$6 vanishes on the cone

$y,x\in F^n$7

Along a line containing sufficiently many points of $y,x\in F^n$8, scalar normalization yields at least $y,x\in F^n$9 distinct roots of a univariate restriction of $y$0. The restriction therefore vanishes identically, forcing $y$1 to vanish on every relevant direction. Since the set of such directions has size at least $y$2, the Schwartz–Zippel bound,

$y$3

gives a contradiction when $y$4.

A strengthened argument uses a polynomial $y$5 of total degree at most $y$6. If

$y$7

dimension counting gives a nonzero $y$8 vanishing on $y$9. Writing

$x$0

into homogeneous components and restricting $x$1 to a complete Kakeya line produces a univariate polynomial of degree at most $x$2 vanishing at all $x$3 field elements. Its coefficients vanish, successively implying

$x$4

The constant component also vanishes on $x$5, contradicting nonzeroness. Consequently,

$x$6

and hence $x$7, with $x$8 depending only on $x$9 (0803.2336).

The finite-field conclusion is essentially optimal in its dependence on $L_{y,x}=\{y+ax:a\in F\}.$0, since $L_{y,x}=\{y+ax:a\in F\}.$1 itself is a Kakeya set. It is not, however, a proof of the Euclidean Kakeya conjecture: the finite-field argument relies on the fact that a degree-$L_{y,x}=\{y+ax:a\in F\}.$2 polynomial over $L_{y,x}=\{y+ax:a\in F\}.$3 cannot vanish at every field element unless it is zero.

3. Finite rings and arithmetic modular Kakeya sets

For $L_{y,x}=\{y+ax:a\in F\}.$4, a line in direction $L_{y,x}=\{y+ax:a\in F\}.$5 is

$L_{y,x}=\{y+ax:a\in F\}.$6

The definition of projective directions must account for nonunits and zero divisors. For

$L_{y,x}=\{y+ax:a\in F\}.$7

a direction is represented by a vector whose reduction modulo every $L_{y,x}=\{y+ax:a\in F\}.$8 has at least one unit coordinate, with representatives identified under multiplication by units. A modular Kakeya set contains a complete line in every such direction (Dhar, 2021).

For square-free $L_{y,x}=\{y+ax:a\in F\}.$9, the Chinese remainder theorem gives

$x\in F^n$0

Dhar and Dvir proved

$x\in F^n$1

Since

$x\in F^n$2

the factor $x\in F^n$3 is $x\in F^n$4, yielding, for every $x\in F^n$5,

$x\in F^n$6

This proves the square-free case of the Hickman–Wright conjecture (Dhar et al., 2020).

The proof uses a line matrix $x\in F^n$7, whose rows are line indicators and whose columns are indexed by points. Since all row supports lie in $x\in F^n$8,

$x\in F^n$9

The matrix is multiplied by point–hyperplane incidence matrices. Over $k$00, the relevant incidence matrix has rank

$k$01

For composite square-free moduli, tensor-product rank arguments combine the prime components even though the selected line in one component may depend on the complete direction, rather than solely on that component.

The general-modulus theorem establishes the Kakeya conjecture over $k$02 for every $k$03. If $k$04, then every modular Kakeya set satisfies

$k$05

If every $k$06, the stronger estimate is

$k$07

These imply

$k$08

for every fixed $k$09 and sufficiently large $k$10 (Dhar, 2021).

Prime powers require a different method because ordinary finite-field polynomial evaluation is unavailable. For $k$11, the method uses roots of unity, quotient polynomial rings, Vandermonde-type matrices, Hasse derivatives, and multiplicity decoding. A key rank estimate is

$k$12

The multiplicity method also yields stronger bounds for $k$13-Kakeya sets. If at least an $k$14-fraction of directions contain $k$15-rich lines, then

$k$16

where the modulus is $k$17. If $k$18, then

$k$19

The dependence on $k$20 is linear and the dependence on $k$21 is $k$22 (Dhar, 2021).

4. Local rings, incidence geometry, and finite geometric variants

Arithmetic Kakeya phenomena also occur over non-archimedean local rings. In $k$23, Dummit and Hablicsek construct a measure-zero Kakeya set. Write

$k$24

and define

$k$25

The set

$k$26

contains a line in every direction $k$27. Symmetrizing under coordinate interchange gives a Kakeya set in all reduced directions. For $k$28, taking

$k$29

preserves the Kakeya property and Haar measure zero (Dummit et al., 2011).

The measure-zero assertion follows from finite-stage coefficient systems. If $k$30 counts compatible coefficient tuples, the construction produces a Markov chain on

$k$31

in which every nonzero state has a uniformly positive proportion of transitions to zero. Consequently,

$k$32

At the same time, every Kakeya set in $k$33 or $k$34 has full Minkowski dimension $k$35. Discretizing modulo $k$36 or $k$37, one obtains finite-ring Kakeya sets of size at least

$k$38

Thus, over $k$39,

$k$40

which gives

$k$41

This separates Haar measure from Minkowski dimension: the density $k$42 tends to zero, while the exponential growth rate of $k$43 remains $k$44.

A different finite-geometric variant restricts the permitted directions to a nonsingular conic $k$45. In the linear representation $k$46, a Kakeya line set consists of $k$47 affine lines, one in each direction represented by $k$48. The smallest associated point set has size

$k$49

The extremizers arise from partitioning the selected directions between the two reguli of a hyperbolic quadric. If $k$50 lines are chosen from one regulus and $k$51 from the other, then

$k$52

For odd $k$53, this equals

$k$54

so the minimum occurs for the most balanced partition.

The classification is governed by the line-intersection graph: vertices represent selected lines, and adjacency means intersection. Maximal cliques are edge-disjoint, and the union size satisfies

$k$55

where $k$56 counts maximal cliques of size $k$57. A strengthened Mantel stability argument shows that sufficiently small Kakeya sets have an intersection graph close to a balanced complete bipartite graph. Geometry then forces the two parts into the two reguli of a hyperbolic quadric. For odd $k$58, all sets below

$k$59

are classified in this way; for even $k$60, the corresponding threshold is

$k$61

These results concern finite geometric configurations and do not directly imply results for integer arithmetic Kakeya sets (Boeck, 2016).

5. Additive combinatorics, entropy, and geometric dimension

The arithmetic Kakeya conjecture has several equivalent formulations. For a finite $k$62, define

$k$63

The Katz–Tao projection formulation asserts that for every $k$64, there exist rational slopes $k$65 such that

$k$66

for every finite $k$67. Since $k$68 is the difference projection, this is a sum-difference inequality.

The entropy formulation states that, for finitely supported real-valued random variables $k$69, there are rational $k$70 such that

$k$71

Green and Ruzsa proved the equivalence of the progression, projection, entropy, finite-field progression, and prime-divisibility formulations (1712.3381).

The finite-field progression formulation defines $k$72 as the smallest size of a set in $k$73 containing a $k$74-term progression in every nonzero direction. Its conjectural asymptotic is

$k$75

For complete lines, the corresponding finite-field assertion is already known by the polynomial method; the arithmetic conjecture is stronger because it concerns bounded-length progressions before $k$76 tends to infinity.

The arithmetic Kakeya conjecture implies the Euclidean Kakeya conjecture for upper Minkowski dimension. Discretizing a Besicovitch set at scale $k$77 produces a finite set of occupied cells containing progression-like configurations in many directions. The projection inequality then yields

$k$78

and therefore

$k$79

The implication has been strengthened from Minkowski to packing dimension. For finite patterns, Green, Morris, and others establish equivalences between discrete arithmetic formulations and minimum Minkowski and packing dimensions. In particular, if a set contains a $k$80-term progression for every scaling factor in $k$81, then its minimum Minkowski and packing dimensions coincide with the corresponding finite arithmetic quantity (Cowen-Breen et al., 2020).

More generally, for a finite pattern $k$82, pattern problems ask for sets containing

$k$83

for every basepoint or scaling parameter in a prescribed set. These formulations include arithmetic progressions, harmonic patterns, homothetic polytopes, and finite configurations whose geometry approaches that of spheres.

For a convex polytope with $k$84 faces, a set containing a homothetic copy centered at every point of $k$85 satisfies the packing-dimension lower bound

$k$86

For simplices this is sharp, and more generally there are constructions with

$k$87

Specially constructed polytopes converging to the sphere have minimum pattern dimensions tending to $k$88 if and only if the arithmetic Kakeya conjecture holds (Cowen-Breen et al., 2020).

For higher-dimensional arithmetic Kakeya, let $k$89 be finite and define $k$90 as the least constant satisfying

$k$91

Pohoata and Zakharov introduce a homogeneous form and prove that, in one dimension, the ordinary and homogeneous constants coincide. If $k$92, then

$k$93

Consequently, an $k$94-Besicovitch set $k$95 satisfies

$k$96

Using the Katz–Tao value $k$97, the bound becomes

$k$98

where $k$99 is the positive solution of

$F=\mathbb F_q$00

(Pohoata et al., 2024).

6. Constructions, quantitative limits, and applications

Arithmetic Kakeya sets can be substantially smaller than the conjectured scale for fixed progression length. Green and Ruzsa construct sets using a product of the first $F=\mathbb F_q$01 odd primes,

$F=\mathbb F_q$02

and representatives $F=\mathbb F_q$03 satisfying

$F=\mathbb F_q$04

The union

$F=\mathbb F_q$05

contains a $F=\mathbb F_q$06-term progression for every $F=\mathbb F_q$07. Quadratic-residue compression gives

$F=\mathbb F_q$08

After choosing parameters, this yields

$F=\mathbb F_q$09

for arbitrarily large $F=\mathbb F_q$10. Thus the conjectured exponent $F=\mathbb F_q$11, even if correct in the double limit, is approached slowly (1712.3381).

The same construction has geometric consequences for linear hashing. For real hashing,

$F=\mathbb F_q$12

the bins partition $F=\mathbb F_q$13 into $F=\mathbb F_q$14 equal intervals. If a set $F=\mathbb F_q$15 contains a $F=\mathbb F_q$16-term progression for every difference $F=\mathbb F_q$17, with $F=\mathbb F_q$18, then every $F=\mathbb F_q$19-element set containing $F=\mathbb F_q$20 has maximum load at least $F=\mathbb F_q$21 for every seed $F=\mathbb F_q$22. Indeed, among

$F=\mathbb F_q$23

two points have circular distance at most $F=\mathbb F_q$24, producing a difference $F=\mathbb F_q$25 for which $F=\mathbb F_q$26. The associated progression lies in an interval of length less than $F=\mathbb F_q$27, so at least half its points occupy a single bin.

The Green–Ruzsa construction therefore yields, for universes of size $F=\mathbb F_q$28,

$F=\mathbb F_q$29

for every real seed $F=\mathbb F_q$30. A reduction transfers the same lower bound to affine modular linear hashing, even pointwise over every modular slope (Bakshi et al., 25 Aug 2026).

The arithmetic Kakeya conjecture itself remains open. A weaker polynomial-length version requires that, for every $F=\mathbb F_q$31,

$F=\mathbb F_q$32

This weaker statement already implies the Kakeya conjecture for upper Minkowski dimension. Conversely, a uniform subpolynomial upper bound for the best-seed load in real linear hashing would imply the polynomial-length arithmetic Kakeya conjecture, and therefore the upper Minkowski-dimension Kakeya conjecture. The implication does not establish the full arithmetic conjecture because the full conjecture fixes $F=\mathbb F_q$33 before sending $F=\mathbb F_q$34 to infinity (Bakshi et al., 25 Aug 2026).

The theory thus contains several distinct levels of result:

• Finite fields: complete-line Kakeya sets have cardinality comparable to the ambient space, with polynomial-method proofs.
• Finite rings: the Kakeya conjecture is proved over $F=\mathbb F_q$35 for every $F=\mathbb F_q$36, with explicit factorization-dependent bounds.
• Local rings: measure-zero Kakeya sets exist in $F=\mathbb F_q$37, while planar Kakeya sets have full Minkowski dimension.
• Integer arithmetic: the arithmetic Kakeya conjecture is equivalent to projection, entropy, finite-field progression, and prime-divisibility statements, but remains unresolved.
• Geometric consequences: the arithmetic conjecture would imply the Euclidean Kakeya conjecture for Minkowski and packing dimensions.
• Applications: progression-rich arithmetic Kakeya sets generate worst-case instances for real and modular linear hashing.

The common structural principle is directional completeness: a set must contain a one-dimensional pattern for every admissible direction, difference, slope, or scaling parameter. Polynomial methods exploit algebraic vanishing, tensor methods exploit Chinese-remainder decompositions, incidence methods quantify overlap, entropy methods compare projections, and digit constructions pass between finite configurations and fractal sets. These mechanisms establish rigorous bridges among arithmetic combinatorics, finite geometry, local-ring analysis, fractal dimension, and hashing, while preserving the distinction between proved finite or conditional statements and the unresolved characteristic-zero arithmetic Kakeya conjecture.