WorksMathematics
Terao's freeness conjecture for arrangements of 15 and 16 lines
Abstract
We prove that Terao's freeness conjecture holds for arrangements of 15 and of 16 lines in the complex projective plane. Together with the theorem of Barakat and Kühne for at most 14 hyperplanes, this shows that freeness of a central arrangement of at most 16 planes in is determined by its intersection lattice. The proof has a theoretical and a computational part. Combining published combinatorial criteria for freeness (due to Abe, Dimca, Dimca-Kühne-Pokora and Yoshinaga) with Bojanowski's Hirzebruch-type inequality and an elementary counting identity, we show that a counterexample would have exponents or for 15 lines and for 16 lines, and an intersection lattice subject to strong numerical constraints. We then enumerate all 22,544,280 simple rank 3 matroids satisfying these constraints, up to isomorphism, and determine the complex realization space of each of them exactly over . Exactly eleven of them are realizable over , and on each of these the freeness of the realizations is constant. As a by-product we classify the free arrangements of 15 and 16 lines that are not divisionally free, have maximal multiplicity smaller than the smaller nontrivial exponent, and have at least four intersection points on every line.
Introduction
Let be a central arrangement of hyperplanes in , let , and let
be a defining polynomial. The module of logarithmic derivations
is a reflexive graded -module of rank , and is called free if is a free -module. In that case the degrees of a homogeneous basis are the exponents of . Terao’s factorization theorem [23] states that the characteristic polynomial then factors as ; in particular the exponents of a free arrangement are determined by its intersection lattice . The converse question is the central open problem of the subject.
Conjecture 1.1 (Terao, see [19 Conj. 4.138]). Let and be arrangements over the same field with isomorphic intersection lattices. If is free, then is free.
The conjecture is open already for , i.e. for line arrangements in the projective plane, which is the case considered here. Over it has been verified for arrangements of at most 12 lines by Faenzi and Vallès [FV14], of 13 lines by Dimca, Ibadula and Măcinic [10], and of 14 lines, over fields of arbitrary characteristic, by Barakat, Behrends, Jefferson, Kühne and Leuner [4]. Barakat and Kühne [5] proved it for all rank 3 arrangements with at most 14 hyperplanes, again over fields of arbitrary characteristic. Their proof enumerates the relevant simple rank 3 matroids with at most 14 elements and computes their moduli spaces, in particular their non-free loci. That approach becomes impractical for larger numbers of hyperplanes, since the number of simple rank 3 matroids grows very fast with the number of elements [16].
Our main result is the following.
Main Theorem. Let , and let and be arrangements of lines in with isomorphic intersection lattices. If is free, then is free.
Corollary 1.2. Terao’s conjecture holds for all central arrangements of at most 16 planes in .
Proof. Arrangements of rank at most two are free. For rank three, combine the Main Theorem with [5 Thm. 1.2].
Strategy
Instead of examining all matroids with 15 or 16 elements, we first use theory to confine a potential counterexample to a very small region. Section combines the following ingredients:
results of Dimca [8] and Dimca–Kühne–Pokora [11], which force , where is the maximal multiplicity of an intersection point and , , are the nontrivial exponents of the free arrangement;
Abe’s restriction on the number of points on a line of a free arrangement [1] together with his division theorem [2], which force every line to contain at most intersection points;
Yoshinaga’s criterion [25], together with the 3-transitivity of on (compare Wakamiko’s explicit formula [24]), which forces every line to contain at least four intersection points;
an elementary identity, which we call the budget identity (Lemma ), and Bojanowski’s Hirzebruch-type inequality [15, 21].
The outcome (Proposition ) is that a counterexample with lines is of type and an intersection lattice satisfying five explicit numerical conditions (R1)–(R5).
In Section we enumerate all simple rank 3 matroids satisfying (R1)–(R5), up to isomorphism: there are 3, 6 091 145 and 16 453 132 of them, respectively. In Section we compute the complex realization space of each of them exactly over , and we decide freeness on each Galois orbit of realizations by certificates that are verified in exact arithmetic. The results are in Section . Only 11 of the 22 544 280 matroids are realizable over : one of type , ten of type , and none of type . Each of them is either free for all realizations or non-free for all realizations. This proves the Main Theorem. As a by-product we obtain:
Theorem 1.3. Let be a free arrangement of lines in with exponents , , and maximal multiplicity . Suppose that , that every line of contains at least four intersection points, and that is not divisionally free.
(a) If , no such arrangement exists.
(b) If , then is isomorphic to one of the six lattices of Table . They are the lattices of the reflection arrangement (), of Cuntz’s one-parameter family [3 §7] (), of two sub-arrangements of the reflection arrangement of the complex reflection group (), and of rigid arrangements defined over () and over ().
Conversely, every complex arrangement whose lattice is one of is free and satisfies the hypotheses above.
Here is divisionally free if divides for some line (for this agrees with Abe’s definition [2]). Divisional freeness, the condition , and the existence of a line with at most three points are three standard situations in which freeness is known to be combinatorial (§ 3). Theorem 1.3 describes the free arrangements of 15 and 16 lines not covered by them. Abe [1] gives further combinatorial criteria. For instance, freeness is combinatorial when [1 Cor. 5.5] or [1 Cor. 5.4]. These already exclude the five types that we remove in Table 1 by a different argument. The six lattices of Theorem 1.3 are not covered by these criteria, nor by [1 Thm. 2.8(2)] (see Remark 3.6).
On the computer-assisted part
The code, the results and a script that reruns the enumeration and the screening are available as ancillary files (§ 7). The programs implement the specification justified in § 3–§ 5.
Preliminaries
Line arrangements and their lattices
Throughout, is an arrangement of distinct lines in , or equivalently a central arrangement of planes in . A pencil (all lines through one point) is always free, so we may and do assume that the lines are not all concurrent. For an intersection point let be the number of lines through . Let be the number of points of multiplicity , and let . For a line let be the number of intersection points on , and put
Since every other line meets in exactly one point, , and hence
The intersection lattice is determined by the simple rank 3 matroid on the set of lines whose rank 2 flats are the sets of lines through the intersection points. We encode it by the family of its blocks, the sets of lines through the points with ; any two blocks share at most one line. We identify with this matroid and use the words lattice and matroid interchangeably; in the language of incidence geometry, such a matroid is a linear space. All quantities above depend only on the lattice. The characteristic polynomial is with
Freeness and exponents
If is free, its exponents are with and [23]. We always order them so that , and we say that is of type whenever with integers .
Let , and let be the minimal degree of a nonzero syzygy . These Jacobian syzygies form the module , and , where is the Euler derivation. Hence a free arrangement has . Let be the global Tjurina number of , and put .
Ziegler's multirestriction and Yoshinaga's criterion
For a line , the Ziegler multirestriction [Zie89] is the multiarrangement on consisting of the points of , where has multiplicity . It is free (being of rank ), with exponents , , . Moreover is the minimal degree of a nonzero element of .
Theorem 2.2 (Yoshinaga [25 Thm. 3.2]; see also [1 Thm. 2.3]). For every line of an arrangement of lines in , , and is free if and only if .
Lemma 2.3. Let be of type and let . Then is free if and only if , i.e. if and only if has no nonzero element of degree .
Proof. If is free, then and , so . Conversely, the function is increasing for , so implies . Theorem 2.2 then gives equality, hence freeness.
Concretely, let have homogeneous coordinates and write . A derivation , with homogeneous of degree , lies in if and only if divides for every . If , this divisibility is equivalent to the vanishing at of the Hasse derivatives , ; if one uses instead. This is valid in every characteristic. We obtain a system of linear equations in the coefficients of , and we denote its matrix by . If -derivatives are used at every point, the resulting system is implied by the exact one, so its solution space contains , with equality when all .
Reduction to three lattice types
Definition 3.1. A lattice is a Terao counterexample if there are complex line arrangements with , free and not free.
In this section is a Terao counterexample with lines, realized by (free) and (not free), and , , are the exponents of . We put
Lemma 3.2 (counting). For every lattice of type :
(a) and ;
(b) and ;
(c) ; in particular, with ,
(budget identity).
Conversely, for every simple rank matroid on elements, by (2). So determines , and every lattice with is of type .
Proof. (a) The first identity counts pairs of lines; the second is (2) with . (b) . For , note that , so . (c) , and for all .
Lemma 3.3. .
Proof. This is the first assertion of [8 Cor. 1.4]: Terao’s conjecture holds for a free arrangement with . For completeness we include a short argument; in the case it uses [11 Props. 2.1–2.2] instead of the original argument of [8]. We have . By Dimca’s theorem [8 Thm. 1.2], applied to a point of maximal multiplicity , either or .
Case . This case is covered by [8 Cor. 1.4(1)]; we give the argument. Then . Apply [8 Thm. 1.2] to , which has the same . Either , or . The second alternative would give , which is impossible. Hence , and by Lemma 3.2(b). By Theorem 2.1, is free, a contradiction.
Case . By [11 Prop. 2.1], a line arrangement in with lines, maximal multiplicity and is free, with exponents . By [11 Prop. 2.2], if instead , it is free with exponents . Now , and by Lemma 3.2(b), which is or . Hence is free, a contradiction. Hence . □
Lemma 3.4. , i.e. , for every line .
Proof. Fix , and choose with . The deconing of with respect to is the affine arrangement of the lines , , in . Its cone is , so it is free in the sense of [1], and . The affine line contains exactly the intersection points of on other than , i.e. of them. By [1 Cor. 1.2(1)], or .
Suppose that . Then divides , and is free since it has rank 2. By Abe’s division theorem [2 Thm. 1.1], is free, a contradiction. Hence . The reformulation in terms of is (1). □
Lemma 3.5. , i.e. , for every line .
Proof. Suppose that . The Ziegler multirestrictions of and on consist of at most three points with the same multiplicities. Since acts 3-transitively on , they are isomorphic multiarrangements, so is the same for and . (For three points the exponents are given explicitly by Wakamiko’s formula [24].) Since is free, by Lemma 2.3, and then is free by the same lemma, a contradiction. □
Remark 3.6. All arrangements considered here are balanced: every multiplicity is at most half of , because . For balanced arrangements, [1 Thm. 2.8] gives , and freeness is combinatorial as soon as for some line . This would happen Lemma 3.5 to , which we do not need. For the lattices of Theorem 1.3 we have and , so this criterion does not apply to them.
Lemma 3.7 (Bojanowski’s inequality [6]; see [21 Thm. 19], [20 Rem. 2.5]). Let be an arrangement of lines in with for . Then
If is of type , this inequality is equivalent to
Bojanowski’s inequality follows from an inequality of Langer for line arrangements, [15 Prop. 11.3.1], which Langer derives from his orbifold Miyaoka–Yau inequality.
Proof of the equivalence with (4). For every integer ,
as both sides equal . Since equals , and for , summing over all points and using Lemma 3.2(a) gives
Hence Bojanowski’s inequality is equivalent to .
Proposition 3.8. Let be a Terao counterexample with lines, of type . Then
and satisfies:
(R1) for every point with ;
(R2) for every line ;
(R3) ;
(R4) ;
(R5) .
Proof. (R1)–(R5) follow from Lemmas 3.3, 3.4, 3.5, 3.2 and 3.7. Lemma 3.7 applies because and . Since , some point has , so and Lemma 3.3 gives . By Lemma 3.2(c), (R5) holds for every lattice satisfying (R3); we list it because it is used for pruning. By (R2) every summand in (R5) is nonnegative, so . Table 1 lists all types with ; all but the three stated ones have .
Remark 3.9. Each line has two degrees of freedom, a projective frame fixes four lines, and a point of multiplicity imposes conditions. The expected dimension of the space of realizations modulo is therefore
using . In the three remaining types it equals (type , where (R4) and (R5) force ), , and , respectively. This is only a parameter count, not a dimension bound: the incidence conditions need not be independent. It suggests that realizable lattices may be rare, which is what we find.
Remark 3.10. In type we have . By (R5) this forces and , i.e. , for every line.
Enumeration of the residual lattices
For a type from Proposition 3.8, let be the set of isomorphism classes of simple rank 3 matroids on elements satisfying (R1)–(R5). By Proposition 3.8 and Lemma 3.2, every Terao counterexample with 15 or 16 lines lies in one of the three sets , , . In this section we enumerate these sets.
Encoding
A matroid is given by its family of blocks (§ 2.1). Two matroids are isomorphic if and only if their bipartite point–block incidence graphs are isomorphic by an isomorphism preserving the bipartition. We use the canonical labelling of nauty [18] (program labelg, with the points forming the first colour class) and store one canonical graph6 string per class.
Stage 1: heavy configurations
For a matroid , let be its set of blocks of size at least 4, the heavy configuration of . Triple points contribute 0 to , so . For an element of the matroid (a line of the arrangement; in this section we call the elements points, as in the theory of linear spaces) put
Then , where is the number of triple points through , and . Put .
Lemma 4.1. If satisfies (R1)–(R5), then satisfies:
(H1) its blocks have sizes in and pairwise share at most one element;
(H2) for all , and ;
(H3) , and ;
(H4) ;
(H5) for each , let be the number of not in a common block of with , and put . Then for every , and
Conditions (H1)–(H3) are inherited by every subset of .
Proof. (H1) is (R1). For (H2): , by (R5) , and . For (H3): , so ; now use (R5) and (R4). (H4) is (R4). For (H5): the triple points through use disjoint pairs among the elements not yet collinear with . Moreover lies between and , and . Heredity holds because , and can only decrease when blocks are removed.
We generate all heavy configurations satisfying (H1)–(H3), one per isomorphism class, by McKay’s canonical augmentation [17], adding one block at a time, and output those satisfying (H4) and (H5).
The candidate blocks are the sets of size containing no pair already covered, and containing no with .
The canonical deletion of a configuration is the block whose vertex comes last in the canonical labelling of the incidence graph. Blocks are coloured by size, after the points, so the last vertex is always a block.
A child is accepted if and only if the new block lies in the orbit of the canonical deletion under the automorphism group of the child. Isomorphic accepted siblings are identified by comparing canonical graphs.
Every child is tested again against (H1)–(H3), since a candidate block of size at least 5 may overshoot . McKay’s scheme [17] applies because:
(H1)–(H3) are hereditary, so deleting the canonical block of a valid configuration gives a valid configuration;
the candidate filter admits the canonical block of every valid child, since ;
the acceptance test is isomorphism invariant, because the ordered colour partition is fixed.
Hence this produces every isomorphism class of configurations satisfying (H1)–(H3), each at least once; the final deduplication with labelg removes any remaining repetition.
Stage 2: completion by triple points
Let be a representative heavy configuration. A completion is a set of 3-subsets such that is a linear space with heavy configuration satisfying (R1)–(R5). We enumerate the completions by backtracking over the points , ordered by decreasing . At step we choose all triples whose smallest element is , so that takes its final value, and we prune with (R2), (R5) and capacity bounds as in (H5).
We break symmetry as follows. At step , the points that lie in exactly the same existing blocks form classes, and new triples through use only initial segments of the currently unused members of each class. Permuting the remaining unused members of such a class fixes the pre-existing blocks, all processed points, and the triples already chosen at this step. Induction over the triple choices therefore shows that every completion is equivalent to one respecting this rule.
Every satisfying (R1)–(R5) is isomorphic to a completion of the representative of . Therefore the completions of all representatives, after deduplication by canonical form, are exactly the elements of .
Results of the enumeration
| type | heavy configurations | completions found | classes |
| (15; 6, 8) | 1 952 | 1 346 | 3 |
| (15; 7, 7) | 96 725 | 10 016 867 | 6 091 145 |
| (16; 7, 8) | 8 324 811 | 17 590 573 | 16 453 132 |
Table 1 (PDF p. 9).
For (16; 7, 8), the canonical augmentation visited 8 885 007 nodes (about 9 minutes on one core), and the completion visited nodes (about 25 minutes).
Exact computation of realization spaces
Let be a simple rank 3 matroid on . A realization of over a field (of any characteristic) is an arrangement of lines in , labelled by the elements of , whose labelled lattice, defined exactly as over , is .
Normal form and construction sequence
Suppose that admits a frame: four elements, no three of them in a common block. Every residual matroid used below is explicitly checked to admit such a frame. Since acts simply transitively on ordered 4-tuples of lines in general position, every realization is projectively equivalent to a unique one in which the frame lines are , , , . Order the remaining elements. When an element is placed, call a block determined if it contains and at least two placed elements; the corresponding point is then already constructed. There are three kinds of steps:
det: lies in at least two determined blocks, so it is the line through two constructed points;
pencil: lies in exactly one determined block, through the point , so for a parameter ;
free: lies in no determined block, so it depends on two parameters.
In a pencil step, the only line through not of the form is , which is already one of the lines of . So no realization is lost. The cost of the sequence is the number of parameters. We choose frames and orders greedily so as to minimize the cost; correctness does not depend on this choice, and the program checks explicitly that the chosen frame is in general position. With our greedy choice, all 22 544 280 matroids except one received a sequence of cost at most 1.
One parameter
For cost , every line is represented by a vector , built by cross products and pencils. Each vector is made primitive, and every common factor removed is recorded as a forbidden polynomial; at its roots two distinct points or lines of the construction would coincide. Let be the gcd of the required determinants , for all blocks . Let consist of the forbidden polynomials and of the determinants of all triples not contained in a block.
Proposition 5.1. Suppose the sequence has cost 1. Every complex realization of is projectively equivalent to exactly one arrangement with . This arrangement is a realization if and only if and for all . Consequently:
(a) if some is identically 0, or is a nonzero constant, or every irreducible factor of divides an element of , or and some element of is identically 0, then is not realizable over ;
(b) if , the realizations correspond to the roots of the irreducible factors of that divide no element of , and the realizations coming from one factor form a single orbit under ;
(c) if , the realizations form the Zariski open subset of .
Proof. The construction reproduces any normalized realization step by step: det steps are forced, and pencil steps were discussed above. If a constructed vector vanishes at , then two elements that are distinct in give the same point or line. The conditions and say exactly that the blocks of are collinear and that no other triple is. For an irreducible and , vanishes at one root of if and only if , if and only if vanishes at all roots of ; and the roots of are permuted transitively by . □
By the same argument, if the sequence has cost 0, the vectors are integral, is an integer, and has at most one realization up to projective equivalence. It exists, and is then defined over , if and only if and no element of vanishes.
Several parameters
For the single matroid of cost 2, the construction has two pencil steps and no free step. The same cross-product construction therefore gives vectors in and covers every normalized realization. Required determinants must vanish and nonblock determinants must be nonzero, exactly as in the one-parameter case.
This class has the following elementary obstruction, verified directly in the ancillary module exact_multi.py and in the script identifications/certificates.py. It is the class with index 13095 (counted from 0) in the list of type ; its elements are numbered from 0. With the frame and parameters , the construction gives
The triple lies in a block and the triple does not, so a realization would satisfy and . This is impossible, since identically.
Deciding freeness
Freeness is invariant under acting on the coefficients, so by Proposition 5.1(b) it is constant on each orbit of realizations. By Lemma 2.3, deciding freeness of a realization of type amounts to deciding whether the matrix has trivial kernel, for one line . Coordinates on are given by two fixed integral linear forms whose common zero does not lie on .
Proposition 5.2 (certificates). Let be a primitive irreducible factor as in Proposition 5.1(b), let , and let be the corresponding realization.
(a) (free) Suppose is a prime not dividing the leading coefficient of , is a root of , and the reduced arrangement over has the same lattice. If has no nonzero element of degree (computed with the exact system of § 2.3 over ), then is free.
(b) (non-free) Suppose all points of have in . If has a nonzero kernel over , computed by exact Gaussian elimination in , then is not free.
Proof. We apply Lemma 2.3 to through an embedding . (a) Let be the image of in ; it maps to by . Choose coordinate forms on with integral coefficients whose common zero avoids also modulo . The coordinates of the points of then lie in and reduce to the coordinates of the points of on , which are distinct because the lattices agree. At each point use the -direction if and the -direction otherwise. The resulting matrix over is exact both over and, after reduction, over . Its rank over is at most its rank over , since a nonzero maximal minor modulo is the image of a nonzero minor. Hence a trivial kernel modulo gives a trivial kernel over , so and is free. (b) Under the hypothesis the system is exact, so and is not free. □
For a family (), let be the determinant of when the matrix is square. Otherwise let be the gcd of the determinants of a few random integral square combinations . If a member is not free, then the rank of drops and . This holds even where the -direction encoding is not exact, because that encoding only enlarges the kernel (§ 2.3). We take three lines such that the common zero of the two coordinate forms lies on for no in the realization space, so that the forms restrict to coordinates on every , and let . (For and , the only lattices to which this criterion is applied, the three lines and the forms do not depend on . If a point of with had , then would vanish identically and the criterion would simply fail.) If and every irreducible factor of divides an element of , then every realization in the family is free. If is a nonzero constant, all members are free.
In all certificates of type (b) that occur, we checked that every is nonzero in .
Results
Applied to all classes of § 4 (we call this the screening), the computation of § 5 gives the following verdicts.
| classes | 3 | 6 091 145 | 16 453 132 |
| not realizable: constant, or each factor of divides an element of | 2 | 6 021 701 | 16 175 061 |
| not realizable: a constructed vector vanishes identically | 0 | 69 433 | 278 071 |
| not realizable: elementary certificate (cost 2) | 0 | 1 | 0 |
| realizable: finitely many (one Galois orbit) / one family | 1 / 0 | 9 / 1 | 0 / 0 |
Table 1 (PDF p. 11).
The remaining case of Proposition 5.1(a), with an element of vanishing identically, does not occur. Each realizable lattice has a single Galois orbit of realizations, or a single family. The orbit of has one element, since its construction has cost 0. (The program treats this cost-0 case like a family with constant lines, so the ancillary file results/verdict_15_77.txt lists 8 classes with status points and 2 with status family; in the table above is counted among the lattices with finitely many realizations.) All eleven are listed in Table 2. Their blocks are listed in Appendix § 9. Explicit equations of all of them are in the ancillary file results/realizable_lattices.txt.
| field | realizations | freeness, remarks | ||||
| (one orbit) | free (6, 8); | |||||
| minus 7 points | free (7, 7); Cuntz’s family | |||||
| free (7, 7) | ||||||
| (one orbit) | free (7, 7); | |||||
| (one orbit) | free (7, 7) | |||||
| (one orbit) | free (7, 7); | |||||
| (one orbit) | not free | |||||
| (one orbit) | not free | |||||
| (one orbit) | not free; | |||||
| (one orbit) | not free; | |||||
| (one orbit) | not free; |
Table 2. The realizable lattices in ; contains none. The column gives the distribution of the number of points per line (: three lines with 6 points and twelve with 7). “Realizations” counts labelled realizations modulo .
Proof of the Main Theorem. Let be a Terao counterexample with lines. By Proposition 3.8, . By § 4, these sets are completely known. By § 5 and the table at the beginning of this section, exactly eleven of their elements are realizable over . For each of them, freeness is constant on the set of all complex realizations:
for the nine lattices , , , , , the realizations form one Galois orbit, whose freeness is certified by Proposition 5.2;
for , whose construction has cost 0 and whose unique realization is defined over , by Lemma 2.3: the matrix has trivial kernel over (in the family criterion of § 5, is a nonzero constant);
for , by the family criterion (, and every irreducible factor of divides an element of ); see also the certificate in § 6.1.
Hence cannot be a Terao counterexample. ∞ӘА
Proof of Theorem 1.3. Let be as in the theorem. Abe’s restriction (proof of Lemma 3.4) and the absence of divisional freeness give for all . Together with , and Lemmas 3.2 and 3.7, satisfies (R1)–(R5) for its type. Since we have , hence , so Table 1 covers all possible types. Table 1 leaves only the three types above, and is one of the realizable lattices of Table 2 that has a free realization. Conversely, these six lattices have , , and for all ; so all their complex realizations, which are free by Section 6, satisfy the hypotheses and are not divisionally free. □
| type | |||||||
| 15 | (4, 10) | 51 | 3 | 99 | 33 | 3 | excluded |
| 15 | (5, 9) | 46 | 3 | 54 | 18 | 4 | excluded |
| 15 | (6, 8) | 43 | 9 | 27 | 9 | 5 | remains |
| 15 | (7, 7) | 42 | 21 | 18 | 6 | 6 | remains |
| 16 | (4, 11) | 61 | 7 | 133 | 45 | 3 | excluded |
| 16 | (5, 10) | 55 | 5 | 79 | 27 | 4 | excluded |
| 16 | (6, 9) | 51 | 9 | 43 | 15 | 5 | excluded |
| 16 | (7, 8) | 49 | 19 | 25 | 9 | 6 | remains |
Table 1. The numerical reduction (Proposition 3.8).
Identifications
. The reflection arrangement is given by with . Its 15 lines form the 3-net of the cyclic group of order 5, and the five lines of each class are concurrent. There are exactly two main classes of Latin squares of order 5. Correspondingly, contains a second matroid with : a 3-net of the non-cyclic class whose three classes are pencils. It is not realizable, which is also seen directly. Each centre lies on the five lines of its class, and , so no line of the arrangement passes through two centres.
If the three centres are not collinear, take them to be the coordinate points. The lines are then , , with , , , where have five elements, and concurrency means . So for all , and lies in the stabilizer of , a subgroup of order at most 5. Hence and are cosets of , and the Latin square is cyclic.
If the centres are collinear, a projective change of coordinates turns the classes into the parallel classes , , . Then , which contradicts in .
The 3-net alone, without concurrent classes, can be realized for a non-group Latin square of order 5; compare [22]. Barakat and Kühne [5 Sect. 8 of the arXiv version] determined the non-free loci of the matroids underlying the reflection arrangements of the groups for ; for prime they found that a representation is free if and only if the characteristic of the field is not . For this already shows that every complex arrangement with lattice is free.
, , . The lattices of sub-arrangements below were computed exactly, with coefficients in the cyclotomic integers (ancillary script
identifications/ident.py). The 816 sub-arrangements of 15 lines of have 11 distinct lattices. Four of them satisfy (R1)–(R5): (remove ), and , , , of type ., . These are sub-arrangements of the reflection arrangement of the Shephard–Todd group . With , consists of the 21 lines , , , and (); it has and exponents . Its 15-line sub-arrangements have 206 distinct lattices, and exactly two of them satisfy (R1)–(R5).
. None of its 231 lattices of 15-line sub-arrangements satisfies (R1)–(R5).
. This is the lattice of Cuntz’s arrangements [[7 §4.2]; see Appendix § 9. In Cuntz’s parametrization, an exact computation (ancillary script
identifications/cuntz.py) shows that has lattice exactly for
For , some of the 15 lines coincide.
At the four roots of and , the lattice becomes that of the Coxeter arrangement , with and exponents .
In the published version [[3 §7]] the family is given in a different, symmetric parametrization, and [[3 Prop. 7.2]] describes its exceptional parameters correctly; its generic member also has lattice (checked by the same script). The description in the preprint [[7 §4.2]] lists and instead of among the exceptional parameters. The arrangement is free with exponents [[3 Prop. 7.2]], and Theorem 1.3 confirms that every complex arrangement with lattice is free.
The script identifications/certificates.py verifies the following short certificate. We use the normalized parameter of the ancillary files (not Cuntz’s ); the arrangements are given explicitly in results/realizable_lattices.txt. The irreducible factors of the polynomials in are exactly the factors of
so by Proposition 5.1(c) the realizations of are the arrangements with . The first line of is . In the coordinates on it, the Ziegler multirestriction is
Represent its points by , in this order, and use the exact system of § 2.3, with Hasse derivatives in at the points with and in at . With the rows ordered by points and then by increasing order of the derivative, and the unknowns ordered as the coefficients of and then of , by decreasing powers of , the matrix of conditions for a derivation of degree 6 satisfies
So whenever , and by Lemma 2.3 every realization of is free.
We have not tried to identify , , and in the literature. is a real arrangement defined over , with defining polynomial
Reproducibility
The ancillary archive contains:
the C programs
heavyaug(Stage 1) andlsgen3(Stage 2), which require nauty;the Python modules for the exact analysis of § 5 and § 6, which use python-flint [14] and SymPy; the class of cost 2 is excluded by the elementary certificate of § 5.3;
the scripts that compute the identifications of § 6.1 exactly and verify the short certificates of § 5.3 and § 6.1, in the folder
identifications;the results, including explicit equations of all realizable lattices;
a script
run.shthat reruns the enumeration and screening of each type, checks the expected counts and canonical-list checksums, and compares all verdicts and detailed records with the supplied results. Its –certificates mode recomputes the eleven realizable cases, the cost-2 obstruction and the stated identifications, without rerunning the exhaustive enumeration.
Every entry of the lists is checked to encode a linear space satisfying (R1)–(R5) when it is screened, and the final verdict rejects any missing, duplicate, out-of-range or inconsistent record. The original computation used gcc 13.3, nauty 2.8.8, Singular 4.3.2, Python 3.13 and python-flint 0.9.0. Exact screening took about 0.9–1.2 ms per class: 1.5 CPU-hours for (15; 7, 7) and 5.5 for (16; 7, 8). The lists , as sorted files of canonical graph6 strings, have SHA-256 checksums
8de6cde5fc270e15cae212de4ee41d5202197e8aeab78cf6e65614650746dcd9 f1be0ac91ef3d5e230d2812b08c3e67e2090445398d9bfd5f7905ab0677a9040 12a4cb695442e91e9d7fc55e9d5abc608c8cf99c14d96f308a4876e668fc9f4d
These refer to the canonical forms of nauty 2.8.8; the reproduction script requires these checksums and stops on a mismatch. Generated lists and intermediate output are not distributed, since the supplied programs regenerate them. The supplied reproduction scripts do not require Singular.
Statements and declarations
Competing interests. The authors have no financial interests to disclose.
Data availability. The code and the results of the computations are available as ancillary files of the arXiv version of this paper (§ 7).
Use of generative AI. Claude (Anthropic) was used for literature search, programming, and drafting the text; ChatGPT (OpenAI) for auditing, and editorial assistance. After using these tools, the authors reviewed and edited the content and takes full responsibility for the content of the publication.
Appendix A. Blocks of the realizable lattices
Lines are numbered 1, . . . , 9, a, . . . , f (so a = 10, . . . , f = 15). Each block, a point of multiplicity at least 3, is written as the word of its lines. The numbering is the canonical one of the ancillary file.
, type (15; 6, 8), . 12345 6cdef 789ab 167 18c 19d 1af 1be 269 27c 28e 2ad 2bf 368 37d 39f 3ae 3bc 46b 47f 48d 49e 4ac 56a 57e 58f 59c 5bd
, type (15; 7, 7), Cuntz’s family. 13bcf 149ae 2367e 2458f 57acd 689bd 12d 34d 5be 6af 79f 8ce
, type (15; 7, 7). 124ad 136be 235cf 189c 279b 378a 457e 469f 568d 7df 8ef 9de abf ace bcd
, type (15; 7, 7), sub-arrangement of . 127ad 138be 239cf 145c 246b 356a 489d 579e 678f 4ef 5df 6de 7bc 8ac 9ab
, type (15; 7, 7). 145ab 278ac 369bc 168e 179d 249e 256f 347f 358d 46d 57e 89f adf bef cde
, type (15; 7, 7), sub-arrangement of . 1389b 247ab 126c 145f 235e 346d 578c 59ad 679f 68ae 7de 8df 9ce acf bcd bef
, type (15; 7, 7). 12345 169cd 178ab 2ade 2bcf 37ce 38df 46af 489e 56be 579f
, type (15; 7, 7). 123456 18def 19abc 279d 37be 47cf 578a 2ae 39f 48b 5cd 689 6af 6bd 6ce
, type (15; 7, 7), sub-arrangement of . 124567 138ace 239bdf 4ab 4cf 4de 589 5ad 5bc 68b 69a 6ef 78f 79e 7cd
, type (15; 7, 7), sub-arrangement of . 5bcdef 6789af 12345 16b 17e 18d 1ac 27c 28e 29d 2ab 36c 37d 39b 3ae 46e 48b 49c 4ad
, type (15; 7, 7), sub-arrangement of . 123456 1789a bcdef 27b 28d 29f 2ae 37e 38c 39d 3af 47f 48b 49c 4ad 57c 58f 59e 5ab 67d 68e 69b 6ac
Cuntz’s family. Following [7 §4.2], is defined by the normal vectors
References
Simion Stoilow Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, RO-014700 Bucharest, Romania Email address: [email protected]
Simion Stoilow Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, RO-014700 Bucharest, Romania Email address: [email protected]
References
- [1]T. Abe, Roots of characteristic polynomials and intersection points of line arrangements, J. Singul. 8 (2014), 100–116.arxiv.org/abs/1302.3822
- [2]T. Abe, Divisionally free arrangements of hyperplanes, Invent. Math. 204 (2016), 317–346.DOI
- [3]T. Abe, M. Cuntz, H. Kawanoue, T. Nozawa, Non-recursive freeness and non-rigidity, Discrete Math. 339 (2016), 1430–1449.DOI
- [4]M. Barakat, R. Behrends, C. Jefferson, L. Kühne, M. Leuner, On the generation of rank 3 simple matroids with an application to Terao’s freeness conjecture, SIAM J. Discrete Math. 35 (2021), 1201–1223.DOI
- [5]M. Barakat, L. Kühne, Computing the nonfree locus of the moduli space of arrangements and Terao’s freeness conjecture, Math. Comp. 92 (2023), 1431–1452; arXiv:2112.13065.DOI
- [6]R. Bojanowski, Zastosowania uogólnionej nierówności Bogomolova–Miyaoka–Yau [Applications of the generalized Bogomolov–Miyaoka–Yau inequality], Master’s thesis, University of Warsaw, 2003 (in Polish).
- [7]M. Cuntz, Free, not recursively free and non rigid arrangements, arXiv:1406.6154v1 (2014); incorporated into [ACKN16].arxiv.org/abs/1406.6154
- [8]A. Dimca, Curve arrangements, pencils, and Jacobian syzygies, Michigan Math. J. 66 (2017), 347–365.arxiv.org/abs/1601.00607
- [9]A. Dimca, Freeness versus maximal global Tjurina number for plane curves, Math. Proc. Cambridge Philos. Soc. 163 (2017), 161–172.DOI
- [10]A. Dimca, D. Ibadula, A. Măcinic, Freeness for 13 lines arrangements is combinatorial, Discrete Math. 342 (2019), 2445–2453.DOI
- [11]A. Dimca, L. Kühne, P. Pokora, Free line arrangements with low maximal multiplicity, J. Algebraic Combin. 63 (2026), Art. 45; arXiv:2505.01733.DOI
- [12]A. A. du Plessis, C. T. C. Wall, Application of the theory of the discriminant to highly singular plane curves, Math. Proc. Cambridge Philos. Soc. 126 (1999), 259–266.DOI
- [14]The FLINT team, FLINT: Fast Library for Number Theory, version 3.6.0 (via python-flint 0.9.0), 2026, https://flintlib.org.
- [15]A. Langer, Logarithmic orbifold Euler numbers of surfaces with applications, Proc. London Math. Soc. (3) 86 (2003), 358–396.
- [16]Y. Matsumoto, S. Moriyama, H. Imai, D. Bremner, Matroid enumeration for incidence geometry, Discrete Comput. Geom. 47 (2012), 17–43.DOI
- [17]B. D. McKay, Isomorph-free exhaustive generation, J. Algorithms 26 (1998), 306–324.DOI
- [18]B. D. McKay, A. Piperno, Practical graph isomorphism, II, J. Symbolic Comput. 60 (2014), 94–112.
- [19]P. Orlik, H. Terao, Arrangements of Hyperplanes, Grundlehren Math. Wiss. 300, Springer, Berlin, 1992.DOI
- [20]P. Pokora, The orbifold Langer–Miyaoka–Yau inequality and Hirzebruch-type inequalities, Electron. Res. Announc. Math. Sci. 24 (2017), 21–27.DOI
- [21]P. Pokora, Hirzebruch-type inequalities viewed as tools in combinatorics, Electron. J. Combin. 28 (2021), #P1.9.DOI
- [22]J. Stipins, Old and new examples of k-nets in ℙ², arXiv:math/0701046 (2007).arxiv.org/abs/math/0701046
- [23]H. Terao, Generalized exponents of a free arrangement of hyperplanes and Shephard–Todd–Brieskorn formula, Invent. Math. 63 (1981), 159–179.
- [24]A. Wakamiko, On the exponents of 2-multiarrangements, Tokyo J. Math. 30 (2007), 99–116.DOI
- [25]M. Yoshinaga, On the freeness of 3-arrangements, Bull. London Math. Soc. 37 (2005), 126–134.DOI