Chapter 4
Equality and Maximal Arcs
Kakeya Sets with Multiplicity
Sections in this chapter
4.1 The dictionary
Let be an -fold configuration and its dual point set (§2.2): , , and every line through contains exactly points of . For a line not through , is the multiplicity of the affine point , and (2.1) says is the number of lines not through that meet .
Lemma 4.1. Let . Then every line through meets in exactly points, and for a line not through , . In particular: every point of has multiplicity exactly if and only if is a maximal arc of degree .
Proof. The first two statements are immediate from the definition of . If every (multiplicity meaning ), then every line meets in or points, and ; conversely if is a maximal arc of degree then each for , i.e. each . ∎
The size check is reassuring: a maximal arc of degree has points (Lemma 2.3).
4.2 The equality theorem
Theorem 4.2 (Theorem B). An -fold configuration attains the bound if and only if is a maximal arc of degree in . Conversely, if is a maximal arc of degree and is any point of , then , computed in coordinates in which , is an -fold configuration attaining the bound.
Proof. The first statement is Theorem 3.2 combined with Lemma 4.1. For the converse, choose a projective coordinate system with ; then every line through meets in points, so has exactly points on each line through and , and is an -fold configuration. Its multiplicities are the values , , which are or ; so every point of its union has multiplicity and Theorem 3.2 gives equality. ∎
Corollary 4.3. if and only if , or is even and . In all other cases, and in particular for every odd and every , .
Proof. By Theorem 4.2, equality holds for some configuration iff a maximal arc of degree exists in , with . For the whole plane is such an arc; for , the affine plane; these are and . For , existence holds iff is even and , by Lemma 2.3, Theorem 2.4, and Theorem 2.6. ∎
Thus the equality cases of the counting bound are completely known, and the list is short. For they are together with ; for odd, only . The strict inequality for odd rests on the Ball–Blokhuis–Mazzocca theorem and I know no elementary proof of it, even for ; the case is the classical statement that a -set in , odd, has three collinear points, which does have elementary proofs.
4.3 Examples
Dual hyperovals (, even). A hyperoval through dualises to lines, one per direction, no three concurrent: . This is the Blokhuis–Mazzocca minimum for even , recovered.
Pencil complements (). The affine plane is a maximal arc of degree ; choosing to be an affine point and dualising, one obtains all lines not through a fixed point , i.e. lines per direction, with union the plane minus that point: . The same configuration is described directly in §7.1.
Dual Denniston arcs. For and , the arc of Theorem 2.4 contains the origin, and dualising with the origin gives an -fold configuration with and all multiplicities . For , : lines, three per direction, union of points, every one on exactly four lines. This configuration was constructed explicitly (Appendix A.2) and its multiplicities verified. In odd order no such regularity is possible (Corollary 4.3); for comparison, the extremal , configuration has points of multiplicity , , , and (§6.4).
Sub-configurations. By Remark 2.5, a Denniston arc of degree contains Denniston arcs of every degree through the origin, so the dual -fold configuration contains -fold sub-configurations attaining their own bounds. A -fold configuration in of the dual Denniston kind thus contains a dual hyperoval of points inside its . Choosing lines per direction from the dual arc with gives upper bounds for that turn out to be sharp in the one case that could be checked (§7.2).
4.4 Two remarks on the duality
First, the duality is not an isomorphism of extremal problems in general: the dual of an -fold configuration has the specific form " points on each line of the pencil at ", and the quantity minimised is the number of lines meeting it, which is not a standard quantity for point sets. It becomes standard exactly in the equality case, where "no line meets in a number of points other than or " is the definition of a maximal arc. This is why the equality case is fully understood while the near-equality cases are not: the theory of maximal arcs is rigid, and its stability version (how close to a maximal arc can a set be when no maximal arc exists?) is not part of it.
Second, the correspondence gives an interpretation of in the dual plane: is the largest number of lines not through that can be skew to a set with points on each line through . For and odd, Blokhuis and Mazzocca's theorem says this is , attained when the chosen lines are tangents of a conic together with one further line. In the dual plane then consists of points of a conic through together with a point on the tangent at , and the skew lines are the external lines of the conic other than the of them through , which is how arises. For the maximisers are unknown beyond the computed cases.