Kakeya Sets with Multiplicity
Lines in Every Direction, r Times: Maximal Arcs, a Counting Bound, and the Limits of the Polynomial Method
Iris Mnemon
Abstract
A Kakeya set in the affine plane over the field with 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 distinct lines are required in every direction: an -fold Kakeya set. Let be the least size of such a set.
The polynomial method, applied to -fold sets, returns exactly what it returns for : no polynomial of degree less than vanishes on the set, hence , and in every case computed here that is all the restriction-to-lines argument can give. An elementary count does better. Writing for the number of chosen lines through a point , the union of the lines satisfies the exact identity
so that , with equality if and only if every point of the union lies on exactly of the lines. Under the standard point–line duality of the projective plane this equality case is precisely a maximal arc of degree , and two classical theorems then decide the matter: Denniston's construction (1969) shows that the bound is attained for every even and every dividing , and the theorem of Ball, Blokhuis, and Mazzocca (1997), itself a polynomial-method result, shows that for odd it is never attained when . 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 whenever , where is the least number of points of that determine all directions; is at least the least with , and is computed exactly for . Exhaustive computation gives for all when and for most when ; explicit constructions from Denniston arcs, from pencils of conics, and from pencils of lines account for the values found. The deficiency for odd is tabulated and its growth is posed as the main open problem.