Kakeya Sets with Multiplicity

Lines in Every Direction, r Times: Maximal Arcs, a Counting Bound, and the Limits of the Polynomial Method

Iris Mnemon

mathematics

Start reading

Abstract

A Kakeya set in the affine plane AG(2,q)AG(2,q) over the field with qq elements is a set containing a line in every direction. Its minimum size was determined by Blokhuis and Mazzocca in 2008, after Dvir's polynomial-method bound of 2008 had settled the order of magnitude in every dimension. This dissertation studies the natural generalisation in which rr distinct lines are required in every direction: an rr-fold Kakeya set. Let κr(q)\kappa_r(q) be the least size of such a set.

The polynomial method, applied to rr-fold sets, returns exactly what it returns for r=1r=1: no polynomial of degree less than qq vanishes on the set, hence κr(q)(q+12)\kappa_r(q)\ge\binom{q+1}{2}, and in every case computed here that is all the restriction-to-lines argument can give. An elementary count does better. Writing mPm_P for the number of chosen lines through a point PP, the union UU of the lines satisfies the exact identity

U=rr+1q(q+1)+1(r+1)2PU(mPr1)2,|U|=\frac{r}{r+1}\,q(q+1)+\frac{1}{(r+1)^2}\sum_{P\in U}(m_P-r-1)^2,

so that κr(q)rr+1q(q+1)\kappa_r(q)\ge\frac{r}{r+1}q(q+1), with equality if and only if every point of the union lies on exactly r+1r+1 of the lines. Under the standard point–line duality of the projective plane this equality case is precisely a maximal arc of degree r+1r+1, and two classical theorems then decide the matter: Denniston's construction (1969) shows that the bound is attained for every even qq and every r+1r+1 dividing qq, and the theorem of Ball, Blokhuis, and Mazzocca (1997), itself a polynomial-method result, shows that for odd qq it is never attained when 2r+1q12\le r+1\le q-1. Thus the polynomial method, shut out at the front door, returns through the back.

Near the other end of the range the problem is solved exactly. It is shown that κqs(q)=q2s\kappa_{q-s}(q)=q^2-s whenever sD(q)2s\le D(q)-2, where D(q)D(q) is the least number of points of AG(2,q)AG(2,q) that determine all q+1q+1 directions; D(q)D(q) is at least the least tt with (t2)q+1\binom t2\ge q+1, and is computed exactly for q16q\le16. Exhaustive computation gives κr(q)\kappa_r(q) for all rr when q7q\le7 and for most rr when q{8,9}q\in\{8,9\}; explicit constructions from Denniston arcs, from pencils of conics, and from pencils of lines account for the values found. The deficiency κr(q)rr+1q(q+1)\kappa_r(q)-\frac{r}{r+1}q(q+1) for odd qq is tabulated and its growth is posed as the main open problem.

Contents