This paper establishes a correspondence between line arrangements and lines in projective space, classifies certain 3-net configurations over complex numbers, and introduces new properties and constructions for these nets.
Contribution
It introduces a novel correspondence linking line arrangements to projective lines, enabling classification of (3,q)-nets and revealing new properties and realizability conditions.
Findings
01
Nine realizable (3,6)-nets out of twelve possible cases.
02
New properties for 3-nets, including moduli dimensions and field realization constraints.
03
Construction of a (3,8)-net family related to the Quaternion group.
Abstract
We show a one-to-one correspondence between arrangements of d lines in the projective plane, and lines in P^{d-2}. We apply this correspondence to classify (3,q)-nets over the complex numbers for all q<=6. When q=6, we have twelve possible combinatorial cases, but we prove that only nine of them are realizable. This new case shows several new properties for 3-nets: different dimensions for moduli, strict realization over certain fields, etc. We also construct a three dimensional family of (3,8)-nets corresponding to the Quaternion group.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Coding theory and cryptography · Finite Group Theory Research
We show a one-to-one correspondence between arrangements of d lines in P2, and lines in Pd−2. We apply this correspondence to
classify (3,q)-nets over C for all q≤6. When q=6, we have twelve possible combinatorial cases, but we prove that only nine of them
are realizable over C. This new case shows several new properties for 3-nets: different dimensions for moduli, strict realization over
certain fields, etc. We also construct a three dimensional family of (3,8)-nets corresponding to the Quaternion group.
1. Introduction.
We start by showing a one-to-one correspondence between arrangements of d lines in P2, and lines in Pd−2. This correspondence is a
particular case of a more general one between arrangements of d sections on ruled surfaces, which generalize line arrangements (see Remark
2.1), and certain curves in Pd−2. This was developed by the author in [21]. In there, we consider arrangements as single
curves via moduli spaces of pointed stable rational curves. One of the main ingredients is the description of these moduli spaces given by
Kapranov in [14] and [15]. In the present paper, we only treat the case of line arrangements, giving a proof of this
correspondence by means of quite elementary geometry. An important consequence of seeing an arrangement as a single curve is, as it turns out,
to answer questions about realization of certain line arrangements. That is the second part of this paper. Through this correspondence, we are
able to classify the so-called (3,q)-nets over C for all q≤6, and the Quaternion nets. This classification shows various new
properties for 3-nets, and opens the question about realization of Latin squares in PC2 (they give the combinatorial data which
defines a 3-net). The following is an outline of the paper.
In Section 2, we prove a one-to-one correspondence between arrangements of d lines, and lines in Pd−2. An arrangement of d
lines is a set
[TABLE]
of d labeled lines in P2 such that ⋂i=1dLi=∅. As it was pointed out
above, our general correspondence is between arrangements of sections and curves. For this reason, instead of considering line arrangements, we
consider pairs (A,P) where A is an arrangement of d lines, and P∈P2 is a point outside of ⋃i=1dLi. In Proposition
2.1, we prove a one-to-one correspondence between these pairs, up to projective equivalence, and lines in Pd−2 outside of a fixed
hyperplane arrangement Hd. We also sketch a second proof of it (see Remark 2.1) to hint the more general correspondence mentioned
before (see [21] for details).
Under this correspondence, for a fixed arrangement A, different choices of P may produce different lines in Pd−2. Thus, if one fixes
the combinatorial type of A and wants to study its moduli space, the presence of this artificial point P introduces more parameters than
needed. In practice, even the question of realization of A becomes hard with this extra point P. To eliminate this difficulty, we take P
in A and consider the new pair (A′,P), where the lines in A′ are the lines in A not containing P (with a certain labelling). By
taking P as a point lying on several lines of A, one greatly simplifies computations to prove or disprove its realization over some field,
and to find a moduli space for its combinatorial type.
In Sections 3 and 4, we use our method to study a particular type of line arrangements which are called nets. There is a large
body of literature about them (cf. [1], [3], [5], [6], [17], [22],
[19], [20], [9]). Nowadays, they are of interest to topologists who study resonance varieties of complex line
arrangements (see [17], [22], [4], [9]). In general, they can be thought as the geometric
structures of finite quasigroups, which in turn are intimately related with Latin squares [6]. We define (p,q)-nets in Section
3. We exemplify our correspondence by computing the Hesse arrangement, which is the only (4,3)-net over C, and by showing that
(4,4)-nets do not exist in characteristic different than 2 (they do in characteristic 2, see Example 3.3). In [22],
Yuzvinsky proved that (p,q)-nets over C are only possible for p=3,4,5 (not true in positive characteristic, where any p is possible,
see Example 3.3). Examples of (5,q)-nets were unknown, and for (4,q)-nets the only example was the Hesse arrangement. In
[19], Stipins proved that (5,q)-nets do not exist over C, leaving open the case p=4. It is believed that the only (4,q)-net
is the Hesse arrangement. In Section 4, we present a classification for (3,q)-nets over C with q≤6.
It is known that a q×q Latin square provides the combinatorial data which defines a (3,q)-net (see [6], [17],
[16], [19]). Until very recently, the only known (3,q)-nets corresponded to Latin squares coming from multiplication
tables of certain abelian groups. Yuzvinsky conjectured in [22] that this should always be the case. In [19], there was
given a three dimensional family of (3,5)-nets not coming from a group. For the case q=6, we have twelve possible cases associated to the
twelve main classes of 6×6 Latin squares. In Section 4, we show that only nine of them are realizable in P2 over C. These
nine cases present new properties for 3-nets: we have four three dimensional and five two dimensional families, some of them define nets
strictly over C, for others we have nets over R or even over Q, etc. After that, we construct a three dimensional family of
(3,8)-nets associated to the Quaternion group, which has members defined over Q. The new cases corresponding to the symmetric and
Quaternion groups show that there are (3,q)-nets associated to non-abelian groups (see [22, Conj. 6.1]). Out of this, a natural
question is: find a combinatorial characterization of the main classes of Latin squares (see Remark 3.1) which realize (3,q)-nets
in PC2.
We denote the projective space of dimension n by Pn, and a point in it by [x1:…:xn+1]=[xi]i=1n+1. If
P1,…,Pr are r distinct points in Pn, then ⟨P1,…,Pr⟩ is the projective linear space spanned by them. The
points P1,…,Pn+2 in Pn are said to be in general position if no n+1 of them lie in a hyperplane.
Acknowledgments: I am grateful to Dave Anderson, my thesis advisor Igor Dolgachev, Sean Keel, Finn Knudsen, Janis
Stipins, and Jenia Tevelev for valuable discussions. I would also like to acknowledge the referee for helping me to improve the exposition of
this paper.
2. Arrangements of d lines in P2, and lines in Pd−2.
Definition 2.1**.**
Let d≥3 be an integer. An arrangement of d lines A is a set of d labeled lines {L1,…,Ld} in P2 such
that ⋂i=1dLi=∅.
When the labelling is not relevant, we will consider A as the plane curve ⋃i=1dLi. We introduce ordered pairs (A,P), where
A is an arrangement of d lines in P2, and P is a point in P2∖A. If (A,P) and (A′,P′) are two such pairs, we say
that they are isomorphic if there exists an automorphism T of P2 such that T(Li)=Li′ for every i, and T(P)=P′. Let Ld be the
set of isomorphism classes of pairs (A,P). For example, clearly L3 is a set with only one element, represented by the class
of the pair
[TABLE]
On the other hand, let us fix d points in Pd−2 in general position. We precisely take P1=[1:0:…:0],P2=[0:1:0:…:0],…,Pd−1=[0:…:0:1],Pd=[1:…:1]. Consider the projective linear spaces
[TABLE]
where 1≤r≤d−1 and i1,…,ir are distinct numbers, and let Hd be
the union of all the hyperplanes Λi,j. Hence, Λi,j={[x1:…:xd−1]∈Pd−2:xi=xj} for i,j=d,
Λi,d={[x1:…:xd−1]∈Pd−2:xi=0}, and
[TABLE]
The proof of the following proposition is inspired by a particular case of the so-called Gelfand-MacPherson correspondence [15, Chap.
2].
Proposition 2.1**.**
There is a one-to-one correspondence between Ld and the set of lines in Pd−2 not contained in Hd.
Proof.
Let us fix a pair (A,P), where A is defined by the linear polynomials
[TABLE]
Consider the embedding ι(A,P):P2↪Pd−1 given by
[TABLE]
Then, ι(A,P)(P2) is a projective plane,
ι(A,P)(P)=[1:…:1], and ι(A,P)(Li)=ι(A,P)(P2)∩{yi=0} for every i∈{1,2,…,d}. We now
consider the projection
[TABLE]
In this way, if Σi,j={[y1:y2:…:yd]:yi=yj}, we see that
ϱ(Σi,j)=Λi,j. Therefore, we have that \varrho\big{(}\iota_{({\mathcal{A}},P)}({\mathbb{P}}^{2})\big{)} is a line in Pd−2 not contained
in Hd. To show the one-to-one correspondence, we need to prove that ({\mathcal{A}},P)\mapsto\varrho\big{(}\iota_{({\mathcal{A}},P)}({\mathbb{P}}^{2})\big{)} gives a
well-defined bijection between Ld and the set of lines in Pd−2 not contained in Hd. Clearly we have a bijection between
projective planes in Pd−1 passing through [1:…:1] and not contained in ⋃i,jΣi,j, and the set of lines in
Pd−2 not contained in Hd.
Let T:P2→P2 be an automorphism of P2. Let B=\big{(}b_{i,j}\big{)} be the 3×3 invertible matrix corresponding to
T−1. Consider the pair (A′,P′) defined by A′={Li′=T(Li)}i=1d and P′=T(P). Then, the equations defining the lines Li′
are
Hence, we obtain that ι(A,P)=ι(A′,P′)∘T, and so our map ({\mathcal{A}},P)\mapsto\varrho\big{(}\iota_{({\mathcal{A}},P)}({\mathbb{P}}^{2})\big{)} is well-defined on Ld.
It is clearly surjective, so we only need injectivity. Let ι(A,P) and ι(A′,P′) be the corresponding maps for the pairs
(A,P) and (A′,P′) such that ι(A,P)(P2)=ι(A′,P′)(P2). Let T=ι(A′,P′)−1∘ι(A,P):P2→P2. Then, T is an automorphism of P2 such that T(Li)=Li′ for every i and T(P)=P′. Hence they are isomorphic, and so
we have the one-to-one correspondence.
∎
Remark 2.1**.**
The following is a sketch of how this one-to-one correspondence works for arrangements of sections on geometrically ruled surfaces (cf. [Hartshorne, p.
369]) via the moduli spaces M0,d+1 (cf. [14]). We will do it only for line arrangements, and over
C. For the general case see [21].
Let us fix a pair (A,P) as before, and let BlP(P2) be the blow-up of P2 at the point P [Hartshorne, p. 386]. Then, we
have an induced genus zero fibration BlP(P2)→P1. The pull-back of A in BlP(P2) is an arrangement of d
labeled sections, each of which belongs to the fix class E+F. Here E is the exceptional divisor of the blow-up, and F is any fiber.
Conversely, given an arrangement of d sections A in BlP(P2) with members in the fix class E+F, we blow-down the exceptional
divisor E to obtain a pair (A,P) in P2. Isomorphic pairs (A,P) correspond to isomorphic arrangements of sections (via automorphisms
of the fibration BlP(P2)→P1).
Now the correspondence. We have fixed the pair (A,P), and the fibration BlP(P2)→P1 as given above. Consider the
genus zero fibration f:R→P1, where R is the blow-up at all the singular points of A in BlP(P2) except nodes.
Then, f is a family of (d+1)-marked stable curves of genus zero. The markings are given by the labeled lines of A, which are now d
labeled sections of f, and the (−1)-curve coming from the exceptional divisor E in BlP(P2). Therefore, since
M0,d+1 is a fine moduli space, we have the following commutative diagram coming from its universal family.
[TABLE]
Let B′ be the image of g in M0,d+1. It is a projective curve, since f has singular and non-singular fibers, and so f is
not isotrivial. Let us now consider the Kapranov map ψd+1:M0,d+1→Pd−2 [15, p. 81], and let
B=ψd+1(B′). Because of the geometry of the fibers of f and the Kapranov’s construction, one can prove (see [21]) that B
intersects all the hyperplanes Λi,j transversally. Say B intersects Λi,j. This means that the lines Li and Lj of
A intersect in P2. But since they are lines, they can only intersect at one point. Therefore, we must have B.Λi,j=1, and so
deg(B)=1, that is, B is a line in Pd−2. Observe that this line is outside of Hd.
In particular, B′ is a smooth rational curve. It is not hard to see the converse, this is, how to obtain a pair (A,P) from a line in
Pd−2 outside of Hd (see [21]). Moreover, one can check that the pair we obtain is unique up to isomorphism of pairs. In this
way, to prove the one-to-one correspondence, we have to show that the map g is an inclusion.
Assume deg(g)>1. Notice that g is totally ramified at the points corresponding to singular fibers of f, since again they come from
intersections of lines in P2, and so all the singular fibers have distinct points as images in B′. Let sing(f) be the set of points in
P1 corresponding to singular fibers of f. Then, since ⋂i=1dLi=∅, we have ∣sing(f)∣≥3 (at least we have a
triangle in A). Now, by the Riemann-Hurwitz formula, we have
[TABLE]
where ϵ≥0
stands for the contribution from ramification of f not in sing(f). But we re-write the equation as 0=(deg(g)−1)(∣sing(f)∣−2)+ϵ, and since deg(g)>1 and ∣sing(f)∣≥3, this is a contradiction. Therefore, deg(g)=1 and we have proved the one-to-one
correspondence. Again, we refer to [21, Ch. 2 and 3] for the general one-to-one correspondence involving arrangements of sections on
geometrically ruled surfaces.
In this way, for each pair (A,P)∈Ld, we denote its corresponding line in Pd−2 by L(A,P). We now want to describe more
precisely how this one-to-one correspondence relates them.
Definition 2.2**.**
Let K be any field. The pair (A,P) is said to be defined over K if the coefficients of the equations defining the lines in A, and
the coordinates of P are in K.
Hence, for arbitrary fields K, Proposition 2.1 gives a one-to-one correspondence between pairs (A,P) defined over K, and lines
L(A,P) in Pd−2 defined over K.
Definition 2.3**.**
Let 1<k<d be an integer. A point in P2 is said to be a k-point of A if it belongs to exactly k lines of A. If
these lines are {Li1,Li2,…,Lik}, we denote this point by [[i1,i2,…,ik]]. The number of k-points of
A is denoted by tk.
Remark 2.2**.**
The complexity of an arrangement relies on its k-points. There are more constraints for the existence of an arrangement, over some field, than
the plane restriction: any two lines intersect at one point. Combinatorially there are possible line arrangements, with assigned k-points,
which may not be realizable in P2 over C (we will return to this in the next sections, for the particular case of nets). For instance, we
have the Fano arrangement (formed by seven lines with seven 3-points) which is not realizable in P2 over fields of characteristic =2. A rather trivial restriction, which is purely combinatorial, is that the numbers tk must satisfy (2d)=∑k=2d(2k)tk; this is the only linear relation they satisfy for a fix d. In [13], Hirzebruch proved the following inequality
for an arrangement of d lines in the complex projective plane having td=td−1=0,
[TABLE]
This is a non-trivial relation among the numbers tk, which comes from the Miyaoka-Yau inequality for complex algebraic surfaces (see
[21] for more about this type of restrictions). This inequality is clearly not true in positive characteristic.
Let us fix a pair (A,P), and its line L(A,P) in Pd−2. Let λ be a line in P2 passing through P. Notice that λ
corresponds to a point in L(A,P). Let K(λ) be the set of k-points of A in λ, for all 1<k<d; it might be empty or
consist of several points. We write
[TABLE]
Example 2.1**.**
In Figure 1, we have the complete quadrilateral A, formed by the set of lines {L1,…,L6}, and a point P outside of
A. Through P we have all the λ lines. In the figure, we have named two such lines: λ and λ′. Thus, K(λ)={[[3,6]],[[1,4]]} and K(λ′)={[[1,2,3]]}.
The set K(λ) imposes the following constraints for the the point [x1:x2:…:xd−1] in L(A,P) corresponding to λ. For
each k-point [[i1,i2,…,ik]] in K(λ), we have:
•
If for some j, ij=d, then xil=0 for all il=d.
•
Otherwise, xi1=xi2=…=xik=0.
For [[i1,…,ik1]], [[j1,…,jk2]] in K(λ), we have that xia=xjb, otherwise [[i1,…,ik1]]
and [[j1,…,jk2]] would not be distinct points in λ. We will work out various examples when we compute nets in the next
sections.
Assume we know the combinatorial data of (A,P), but we do not know whether is realizable in P2 over some field K. Then, this
realization question is equivalent to the realization question of L(A,P) over K. If we are only interested in the line arrangement A,
the point P introduces unnecessary dimensions which makes the realization question harder. Instead, we consider the new pair (A′,P′), where
P′∈A and the lines of A′ are the lines in A not containing P′ in a certain order. Now, the line L(A′,P′) corresponding to
(A′,P′) is in Pd′−2, and d′<d. So we have less dimensions to work with, and L(A′,P′) completely represents our arrangement A,
by keeping track of P′.
If we take P′ as a k-point with k large, the previous observation will be important to simplify computations to prove or disprove the
realization of A. In addition, we find a moduli space for the combinatorial type of A, forgetting the artificial point P. Again, by
combinatorial type we mean the data given by some of the intersection of its lines.
In the next two sections, we will compute some special configurations by means of the line L(A,P). We make the following choices to write
down equations for the lines in A:
•
The point P will be always [0:0:1].
•
The arrangement A will be formed by {L1,…,Ld}, where Li are the lines of
A, and also their linear polynomials Li(x,y,z)=(aix+biy+z) for every i=d, and Ld=(z).
With these assumptions, it is easy to check that the corresponding line L(A,P) in Pd−2 is [ait+biu]i=1d−1, where [t:u]∈P1.
3. (p,q)-nets in P2.
We now introduce a specific type of line arrangements in P2 which are called nets. Our main references are [6], [17],
[22], [16], [19], and [20]. We begin with the definition of a net taken from [19].
Definition 3.1**.**
Let p≥3 be an integer. A p-net in P2 is a (p+1)-tuple (A1,...,Ap,X), where each Ai is a nonempty finite
set of lines of P2 and X is a finite set of points of P2, satisfying the following conditions:
(1)
The Ai are pairwise disjoint.
(2)
The intersection point of any line in Ai with any line in Aj belongs to X for
i=j.
(3)
Through every point in X there passes exactly one line of each Ai.
One can prove that ∣Ai∣=∣Aj∣ for every i,j and ∣X∣=∣A1∣2 (see [19], [22]). Let us denote ∣Aj∣ by q,
this is the degree of the net. Thus, if we use classical notation (see for example [7] or [10]), a p-net of degree
q is a (qp2,pqq) configuration. Following [19] and [22], we denote a p-net of degree q by
(p,q)-net. We label the lines of Ai by {Lq(i−1)+j}j=1q for all i, and define the arrangement
A={L1,L2,...,Lpq}. We assume q≥2 to get rid of the trivial arrangement, which is actually not considered in Definition
2.1.
Assume for now that we work over an algebraically closed field K. A (p,q)-net A=(A1,...,Ap,X) defines a unique pencil of curves
P(A) of degree q as follows. Take any two sets of lines Ai and Aj. Consider Ai and Aj as the equations which define them,
i.e., the multiplication of its lines. Then, the pencil is defined as
[TABLE]
This is
well-defined. Take Ak with k=i,j, and a point Q in Ak∖X. Then, there exists [u:t]∈P1 such that uAi(Q)+tAj(Q)=0. We write B=uAi+tAj, which is a curve of degree q containing X∪{Q}. If Ak and B do not have common
factors, we have, by Bezout’s Theorem, that Ak belongs to P(A) (Ak is B times a non-zero constant). This proves the independence
of the choice of i,j to define P(A). If Ak and B have a non-trivial common factor, then it has to be formed by the multiplication
of 0<q1<q lines in Ak. In this way, this common factor C contains exactly qq1 points of X. Therefore, if B=CF and Ak=CG,
the set {F=0}∩{G=0} has at least q(q−q1)>(q−q1)2 points, deg(F)=deg(G)=q−q1, and gcd(F,G)=1. This is impossible by
Bezout’s Theorem.
In addition, if the characteristic of K is zero, the general member of this pencil is smooth [Hartshorne, p. 272], i.e., outside of
finitely many points in P1, uAi+tAj is a smooth plane curve. Hence, after we blow up the q2 points in X we obtain a fibration of
curves of genus 2(q−1)(q−2) with at least p completely reducible fibers. This fibration leads to the following restriction on nets
defined over C, due to Yuzvinsky [22] (see [18] for the higher dimensional analogue). The proof is a simple topological
argument which uses the topological Euler characteristic of the fibration.
Proposition 3.1**.**
For an arbitrary (p,q)-net in P2 defined over C, the only possible values for (p,q) are: (p=3,q≥2), (p=4,q≥3) and (p=5,q≥6).
The combinatorial data which defines (p,q)-nets can be expressed using Latin squares. A Latin square is a q×q table filled
with q different symbols (in our case numbers from 1 to q) in such a way that each symbol occurs exactly once in each row and exactly once
in each column. They are the multiplication tables of finite quasigroups. Let A=(A1,...,Ap,X) be a (p,q)-net. The q2p-points
in X are determined by (p−2)q×q Latin squares which form an orthogonal set, as explained for example in [19] or
[16].
Although we have defined nets as arrangements of lines already in P2, we will first “think combinatorially” about the (p,q)-net through
this orthogonal set of (p−2) Latin squares, and then we will attempt to prove or disprove its realization on P2 over some field. This is
the strategy from now on.
Example 3.1**.**
In this example we use our correspondence to reprove the existence of the famous Hesse arrangement. This (4,3)-net has nice
applications in algebraic geometry (see for example [13, 2, 21]). Let us denote this net by A=A1∪A2∪A3∪A4, with Ai={L3i−2,L3i−1,L3i}. By relabelling the lines of A, we may assume that the combinatorial data is given
by the following set of orthogonal Latin squares.
[TABLE]
[TABLE]
These Latin squares give the intersections of A3 and A4 respectively with A1 (columns) and A2 (rows) (see [16] or
[19]). For example, the left one tell us that L2, L6 and L7 (values) have a common point of incidence. The right one says
L2, L6 and L12 have also non-empty intersection. Hence, [[2,6,7,12]]∈X. In this way, we find X, which is completely
described in the following tables.
[TABLE]
[TABLE]
We now consider the new arrangement of lines A′=A∖{L3,L4,L9,L12} together with the point P=[[3,4,9,12]]. We rename the
twelve lines in the following way: A′={L1′=L1,L2′=L2,L3′=L5,L4′=L6,L5′=L7,L6′=L8,L7′=L10,L8′=L11} and the
lines passing through P, α=L3, β=L4, γ=L9, and δ=L12. By our correspondence, we have a line L(A′,P) in
P6 for the pair (A′,P), and it passes through these distinguished four points α, β, γ, and δ (we abuse the
notation, these lines correspond to points in L(A′,P)). Then, K(α)={[[4,6,7]],[[3,5,8]]}, K(β)={[[2,6,8]],[[1,5,7]]},
K(γ)={[[2,3,7]],[[1,4,8]]}, and K(δ)={[[2,4,5]],[[1,3,6]]}. Hence, we write:
[TABLE]
[TABLE]
for some numbers ai (with extra restrictions), and we take L(A′,P):αt+βu, [t:u]∈P1.
For some [t:u], we have the equation αt+βu=γ, and from this we obtain:
[TABLE]
where w is a parameter.
For another pair [t:u], we have αt+βu=δ, and so w2−w+1=0, a7=w1, and a8=w1+w. Therefore, our
field of definition needs to have roots for the equation w2−w+1. For instance, over C, we take w=e3π−1, and then
L(A′,P) is:
[TABLE]
According to our choices at the end of Section 2, we write down the lines
of A as:
[TABLE]
[TABLE]
Notice that the lines in A
corresponding to α, β, γ, and δ are ux−ty=0, where [t:u] is the corresponding point in P1 for each of them,
as points in L(A′,P).
Example 3.2**.**
In this example, we show that there are no (4,4)-nets over fields of characteristic =2. This fact has independently been shown in
[8] over C. We start supposing their existence, let A={Ai}i=14 be such a net. Again, by relabelling the lines of A,
we may assume that the orthogonal set of Latin squares is:
[TABLE]
[TABLE]
We consider (A′,P) defined by the arrangement of twelve lines A′=A∖{L4,L5,L12,L16}, and the point P=[[4,5,12,16]].
The lines of A′ are L1′=L1, L2′=L2, L3′=L3, L4′=L6, L5′=L7, L6′=L8, L7′=L9, L8′=L10, L9′=L11,
L10′=L13, L11′=L14, and L12′=L15. The special lines are α=L4, β=L5, γ=L12, and δ=L16.
Hence, we have that
[TABLE]
[TABLE]
as points in L(A′,P), which we write as
αt+βu, [t:u]∈P1. Let c1=a, c2=b and c3=c. Since γ∈L(A′,P), we have:
[TABLE]
[TABLE]
Also, since δ∈L(A′,P), have ad4=1
and ad1+b=1, plus the following equations: (1):d1(1−c)=1−b−c, (2):d1(1−b)(c−1)+d1c(1−c)=(1−b)c, (3):(1−b)(1+d4(b+c−1))=d4c, and
(4):c2=(1−b)(b+c−1) among others. These equations are enough to produce a contradiction. By isolating d1 in (1), replacing it in (2),
and using (4), we get c3=(1−b)3 which requires a 3rd primitive root of 1. Say w is such, so b=1−wc. Then, by (3), we get
w2(1+2c)=w−1. Since the characteristic of our field is not 2, we have c=w1, and so b=0, and a=1. This gives a1=0, which
is a contradiction, because it would imply that L1∩L4∩L8∩L9∩L15=∅. See next example for the char. 2
case.
Example 3.3**.**
Positive characteristic gives more freedom for the realization of nets compared to Proposition 3.1, and the previous examples. Let q be a
prime number, and let K be a field with m=qn elements. In PK2, we have m2+m+1 points with coordinates in K, and there are
m2+m+1 lines such that through each of these points passes exactly m+1 of these lines, and each of these lines contains exactly m+1 of
these points [12, p. 65]. By eliminating one of these lines, we obtain a (m+1,m)-net. Each of the m+1 members of this net has m
lines intersecting at one point, and so tm=m+1, tm+1=m2, and tk=0 otherwise. Hence, in positive characteristic, there are p-nets
for all p≥3. If we want a (4,4)-net, one takes q=2 (necessary by Example 3.2) and n=2, and considers the corresponding
(5,4)-net. We now eliminate one of its members to obtain a (4,4)-net.
In [20], Stipins proves that there are no 5-nets over C (see [23] for a generalization of his result). His proof does
not use the combinatorics given by Latin squares. We will see that this issue matters for the realization of (3,6)-nets, and so, it would be
interesting to know if Latin squares are relevant or not for the possible realization of 4-nets over C. It is believed that, except for the
Hesse arrangement, (4,q)-nets do not exist over C. In this way, by Proposition 3.1, the only cases left over C would be 3-nets.
In [22], it is proved that for every finite subgroup H of a smooth elliptic curve, there exists a 3-net over C corresponding
to the Latin square of the multiplication table of H. In the same paper, the author proves that there are no (3,8)-nets associated to the
group Z/2Z⊕Z/2Z⊕Z/2Z. In [19], it can be found a classification of (3,q)-nets for q≤5. In the next
section we classify (3,q)-nets for q≤6, and the (3,8)-nets associated to the Quaternion group.
Remark 3.1**.**
(Main classes of Latin squares)
As we explained before, a q×q Latin square gives the set X for a (3,q)-net A={A1,A2,A3}. What if we are interested
only in the realization of A in P2 as a curve, i.e., without labelling lines? Then, we divide the set of all q×q Latin squares
into the so-called main classes (see [6] or [16]).
For a given q×q Latin square M corresponding to A, by rearranging rows, columns and symbols of M, we obtain a new labelling for
the lines in each Ai. If we write M in its orthogonal array representation, i.e. M={(r,c,s):r=row number,c=column number,s=symbol number}, we can perform six operations on M, each of them a permutation of (r,c,s) which translates into
relabelling the members {A1,A2,A3}, and so we obtain the same curve in P2. We can partition the set of all q×q Latin
squares in main classes (also called Species) which means: if M,N belong to the same class, then we can obtain N by applying a finite number
of the above operations to M. In what follows, we will choose one member from each class. The following table shows the number of main classes
for small q.
[TABLE]
4. Classification of (3,q)-nets for q≤6, and the Quaternion nets.
In order to do this classification, we use again the trick of eliminating some lines passing through a k-point P, and considering the new
pair (A′,P). We work with (3,q)-nets, thus P is taken as a 3-point in X (and so, we eliminate three lines from A). If the
(3,q)-net is given by A={A1,A2,A3} such that Ai={Lq(i−1)+j}j=1q, then the new pair (A′,P) will be given by A′={L1′=L2,L2′=L3,…,Lq−1′=Lq,Lq′=Lq+2,Lq+1′=Lq+3,…,L2q−2′=L2q,L2q−1′=L2q+2,L2q′=L2q+3,…,L3q−3′=L3q}, P=L1∩Lq+1∩L2q+1, and α=L1, β=Lq+1, γ=L2q+1. The corresponding line L(A′,P) is αt+βu, [t,u]∈P1.
We obtain X from a given Latin square. Then, we fix a point P in X, so the locus of the line L(A′,P) is actually the moduli space of
the (3,q)-nets with combinatorial data defined by that Latin square (or better its main class). We give in each case equations for the lines
of the nets depending on parameters coming from L(A′,P).
(3,2)-nets.
Here we have one main class given by the multiplication table of Z/2Z:
1
2
2
1
. According to our set up, (A′,P) is formed by an arrangement A′ of three lines and P=[[1,3,5]]∈X. The line
L(A′,P) is actually the whole P1. This tells us that there is only one (3,2)-net, up to projective equivalence. The special points are
α=[1:0], β=[0:1], and γ=[1:1]. This (3,2)-net is represented by the singular members of the pencil λz(x−y)+μy(z−x)=0 on P2, and it is called complete quadrilateral (see Figure 1).
(3,3)-nets.
Again, there is one main class given by the multiplication table of Z/3Z.
[TABLE]
For (A′,P) we have an arrangement of six lines A′ and P=[[1,4,7]]∈X, the line L(A′,P) is in P4. The special points can be
taken as α=[a1:a2:1:0:1], β=[1:0:b1:b2:1], and γ=[1:c1:c1:1:c2]. Then, for some [t:u]∈P1, we have αt+βu=γ. Thus, if a2=a, b2=b and c1=c, we have that \alpha=\big{[}\frac{a(b-1)}{bc}:a:1:0:1\big{]} and
\beta=\big{[}1:0:\frac{bc(a-1)}{a}:b:1\big{]}. The rest of the points in X′ (again, although A′ is not a net, we think of X′ as the set
of 3-points in A′ coming from X) [[1,3,6]] and [[2,4,5]] give the same restriction (a−1)(b−1)=1, i.e., a=b−1b.
Therefore, the line L(A′,P) has two parameters of freedom, and it is given by \bigl{[}\frac{1}{c}:\frac{b}{b-1}:1:0:1\bigr{]}t+[1:0:c:b:1]u where c,b are numbers with some restrictions (for example, c,b=0 or 1). Hence, we find that this family of (3,3)-nets
can be represented by: L1=(y), L2=(c1x+y+z), L3=(b−1bx+z), L4=(x), L5=(x+cy+z), L6=(by+z),
L7=(x+c(1−b)y), L8=(x+y+z), and L9=(z).
(3,4)-nets.
Here we have two main classes. We represent them by the following Latin squares.
M1=
1
2
3
4
2
3
4
1
3
4
1
2
4
1
2
3
M2=
1
2
3
4
2
1
4
3
3
4
1
2
4
3
2
1
They correspond to Z/4Z and Z/2Z⊕Z/2Z respectively. We first deal with M1. Then, we have
α=[a1:a2:a3:1:a4:0:1:a4], β=[1:b1:0:b2:b3:b4:1:b1] and γ=[1:c1:c2:c2:c1:1:c3:c4]. Let a3=a, b4=b and
c2=c. By imposing γ to L(A′,P), one can find a1=bc(−1+b)a, a2=bc(−b1+c1b)a, a4=bc(−b1+c4b)a, b2=a−(c−c2a)b, b3=b1−c4b+c1b, and c3=b1+ac. When we impose L(A′,P) to pass through
[[1,5,9]], [[2,4,9]] and [[1,4,8]], we obtain equations to solve for c4, c1, and b1 respectively. After that, the restrictions
[[2,6,7]], [[3,5,7]], and [[3,6,8]] are trivially satisfied. The line L(A′,P) is parametrized by (a,b,c) in a open set of A3,
and it is given by: a1=bca(b−1), a2=abc+ab−a−bcab, a3=a, a4=abc+ab−a−bca2(b−1),
b1=abc+ab−a−bcb2(a−1)c, b2=abc(a−1), b3=abc+ab−a−bcabc and b4=b.
Similarly, for M2 we have α=[a1:a2:a3:1:a4:0:1:a4], β=[1:b1:0:b2:b3:b4:1:b1], and
γ=[1:c1:c2:1:c1:c2:c3:c4]. Of course, the only change with respect to the previous case is γ. By doing similar computations,
we have that L(A′,P) is parametrized by (a,b,c) in a open set of A3, and it is given by: a1=bc(b−c)a, a2=abc+ab−bc−acabc, a3=a, a4=abc+ab−bc−aca2(b−c), b1=abc+ab−bc−acb2(a−c), b2=acb(a−c),
b3=abc+ab−bc−acabc, and b4=b (see [19, p. 11] for more information about this net).
Hence, the lines for the corresponding (3,4)-nets for Mr can be represented by: L1=(y), L2=(a1x+y+z), L3=(a2x+b1y+z),
L4=(a3x+z), L5=(x), L6=(x+b2y+z), L7=(a4x+b3y+z), L8=(b4y+z), L9=(ax−bc2−ry), L10=(x+y+z),
L11=(a4x+b1y+z), and L12=(z). For example, if we evaluate the equations for the cyclic type M1 at a=21+i,
b=21−i, and c=−i (where i=−1), we obtain the well-known net: A1={y,(1+i)x+2y+2z,(1+i)x+y+2z,(1+i)x+2z},
A2={x,2x+(1−i)y+2z,x+(1−i)y+2z,(1−i)y+2z} and A3={x+y,x+y+z,x+y+2z,z}. This net is projectively equivalent of the one
given by the plane curve (x4−y4)(y4−z4)(x4−z4)=0, known as CEVA(4) [7, p. 435].
(3,5)-nets.
We have two main classes, and we represent them by the following Latin squares.
M1=
1
2
3
4
5
2
3
4
5
1
3
4
5
1
2
4
5
1
2
3
5
1
2
3
4
M2=
1
2
3
4
5
2
1
4
5
3
3
5
1
2
4
4
3
5
1
2
5
4
2
3
1
The Latin square M1 corresponds to Z/5Z. As before, for M1 and M2 we have that α=[a1:a2:a3:a4:1:a5:a6:0:1:a5:a6]
and β=[1:b1:b2:0:b3:b4:b5:b6:1:b1:b2], but for M1, γ=[1:c1:c2:c3:c3:c2:c1:1:c4:c5:c6], and for M2,
γ=[1:c1:c2:c3:1:c1:c2:c3:c4:c5:c6].
In the case of M1, after we impose γ to L(A′,P), we use the conditions [[2,3,5]], [[4,8,11]], [[2,6,12]], [[2,8,9]], and
[[3,8,10]] to solve for b2, c6, c5, b1, and c2 respectively. After that we have four parameters left: a4=a, b6=b,
c3=c, and c1=d, and we get the following constrain for them:
[TABLE]
Hence, the (3,5)-nets for M1 are parametrized by an open set of the hypersurface in A4 defined by this equation. The values for the
variables are:
[TABLE]
[TABLE]
[TABLE]
In the case of M2, we obtain a three dimensional moduli space of (3,5)-nets as well. It is parametrized by (a,b,c) in an open set of
A3 such that a4=a, b6=b and c1=c, and:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
To obtain the lines for the nets corresponding to Mr, we just evaluate: L1=(y), L2=(a1x+y+z), L3=(a2x+b1y+z),
L4=(a3x+b2y+z), L5=(a4x+z), L6=(x), L7=(x+b3y+z), L8=(a5x+b4y+z), L9=(a6x+b5y+z), L10=(b6y+z),
L11=(ax−bc2−ry), L12=(x+y+z), L13=(a5x+b1y+z), L14=(a6x+b2y+z), and L15=(z). These two 3 dimensional families
of (3,5)-nets appear in [19]. We notice that both families of (3,5)-nets have members defined over Q. For the case M1, we
can make b2 disappear from the equation by declaring c=ad (the relations a=1 and d=c are not allowed). Then, b=2da−2da2−1+a−d2a+d2a22da−1−da2, and it can be checked that for suitable a,d∈Z the conditions for being (3,5)-net are
satisfied.
(3,6)-nets.
We have twelve main classes of Latin squares to check. The following is a list showing one member of each class. It was taken from [6, pp.
129-137].
M1=
1
2
3
4
5
6
2
3
4
5
6
1
3
4
5
6
1
2
4
5
6
1
2
3
5
6
1
2
3
4
6
1
2
3
4
5
M2=
1
2
3
4
5
6
2
1
5
6
3
4
3
6
1
5
4
2
4
5
6
1
2
3
5
4
2
3
6
1
6
3
4
2
1
5
M3=
1
2
3
4
5
6
2
3
1
5
6
4
3
1
2
6
4
5
4
6
5
2
1
3
5
4
6
3
2
1
6
5
4
1
3
2
M4=
1
2
3
4
5
6
2
1
4
3
6
5
3
4
5
6
1
2
4
3
6
5
2
1
5
6
1
2
4
3
6
5
2
1
3
4
M5=
1
2
3
4
5
6
2
1
4
3
6
5
3
4
5
6
1
2
4
3
6
5
2
1
5
6
2
1
4
3
6
5
1
2
3
4
M6=
1
2
3
4
5
6
2
1
4
5
6
3
3
6
2
1
4
5
4
5
6
2
3
1
5
3
1
6
2
4
6
4
5
3
1
2
M7=
1
2
3
4
5
6
2
1
4
3
6
5
3
5
1
6
4
2
4
6
5
1
2
3
5
3
6
2
1
4
6
4
2
5
3
1
M8=
1
2
3
4
5
6
2
1
6
5
3
4
3
6
1
2
4
5
4
5
2
1
6
3
5
3
4
6
1
2
6
4
5
3
2
1
M9=
1
2
3
4
5
6
2
3
1
6
4
5
3
1
2
5
6
4
4
6
5
1
2
3
5
4
6
2
3
1
6
5
4
3
1
2
M10=
1
2
3
4
5
6
2
1
6
5
4
3
3
5
1
2
6
4
4
6
2
1
3
5
5
3
4
6
2
1
6
4
5
3
1
2
M11=
1
2
3
4
5
6
2
1
4
5
6
3
3
4
2
6
1
5
4
5
6
2
3
1
5
6
1
3
2
4
6
3
5
1
4
2
M12=
1
2
3
4
5
6
2
1
5
6
4
3
3
5
4
2
6
1
4
6
2
3
1
5
5
4
6
1
3
2
6
3
1
5
2
4
The Latin squares M1 and M2 correspond to the multiplication table of the groups Z/6Z and S3, respectively. The following is the
set up for the analysis of (3,6)-nets. We first fix one Latin square M from the list above. Let A={A1,A2,A3} be the
corresponding (possible) (3,6)-net, where A1={L1,…,L6}, A2={L7,…,L12},, and A3={L13,…,L18}.
As before, we consider a new arrangement A′ together with a point P such that A′=A∖{L1,L7,L13}, and P=[[1,7,13]]∈X. We label the lines of A′ from 1 to 15 following the order of A, i.e., L1′=L2,…,L5′=L6, L6′=L8, etc, eliminating
L1, L7, and L13. Let L(A′,P) be the line in P13 for (A′,P). The special lines (or points of L(A′,P)) α=L1,
β=L7, and γ=L13 are as α=[a1:a2:a3:a4:a5:1:a6:a7:a8:0:1:a6:a7:a8],
β=[1:b1:b2:b3:0:b4:b5:b6:b7:b8:1:b1:b2:b3], and γ=γ(c1,c2,...,c8) depending on M. Since there is [t,u]∈P1 satisfying αt+βu=γ, we can and do write a1, a2, a3, a4, a6, a7, a8, b4, b5, b6, and
c5 with respect to the rest of the variables.
After that, we start imposing the points in X′ which translates, as before, into 2×2 determinants equal to zero. At this stage we
have 20 equations given by these determinants, and 12 variables. We choose appropriately from them to isolate variables so that they appear
with exponent 1. In the way of solving these equations, we prove or disprove realization for A. When the (3,6)-net exists, i.e. A is
realizable in P2 over some field, the equations for its lines can be taken as: L1=(y), L2=(a1x+y+z), L3=(a2x+b1y+z),
L4=(a3x+b2y+z), L5=(a4x+b3y+z), L6=(a5x+z), L7=(x), L8=(x+b4y+z), L9=(a6x+b5y+z), L10=(a7x+b6y+z),
L11=(a8x+b7y+z), L12=(b8y+z), L13=(ux−ty), L14=(x+y+z), L15=(a6x+b1y+z), L16=(a7x+b2y+z), L17=(a8x+b3y+z), and L18=(z), where [t,u] satisfies αt+βu=γ.
Now we apply this procedure case by case. We first give the result, after that we indicate the order we solve the equations coming from the
points in X′, and then we give a moduli parametrization whenever the net exits. For simplicity, we work always in characteristic zero. We
often omit the final expressions for the variables, although they can be given explicitly.
M1: (Z/6Z) This gives a three dimensional moduli space. We have that some of these nets can be defined over R. We solve
the determinants in the following order: [[4,6,15]] solve for c3, [[5,10,14]] solve for c8, [[1,9,15]] solve for c1, [[5,9,13]]
solve for c7, [[3,10,12]] solve for c6, [[2,10,11]] solve for b3, [[3,9,11]] solve for c2, and [[2,8,15]] solve for b2.
If a5=a, b1=d, b8=b, and c4=c, then they must satisfy:
So, the moduli space for these nets is an open set of this hypersurface.
M2: (S3) This gives a three dimensional moduli space parametrized by an open set of A3. It does not contains (3,6)-nets
defined over R. The reason is that we need the square root of −1 to define the nets. Moreover, all of them have extra 3-points, apart
from the ones coming from X. The order we take is: [[5,10,14]] solve for c8, [[2,6,15]] solve for c1, [[1,10,13]] solve for
c7, [[1,9,12]] solve for c6, [[2,10,11]] solve for b1, [[5,6,12]] solve for c3, [[1,8,15]] solve for b2, [[1,7,14]]
solve for b8, and [[2,8,14]] solve for c2. If i=−1, a5=a, b3=e and c4=c, then the expressions for the variables are:
For instance, if we plug in a=1+i3−2cc+ic3 and e=2(c−1)c(1+i3), we get a one dimensional family of
arrangements of 18 lines with t2=18, t3=39, t4=3, tk=0 otherwise.
M3: This gives a three dimensional moduli space which does not contains (3,6)-nets defined over R. The reason again is that
we need to have the square root of −1 to realize the nets. The order we solve is: [[5,10,11]] solve for b8, [[1,9,15]] solve for c8,
[[5,9,12]] solve for c6, [[3,6,15]] solve for c1, [[1,10,13]] solve for c7, [[4,9,11]] solve for b3, [[1,6,12]] solve for
b1, and [[3,10,12]] solve for b2. If a5=a, c3=d, c2=e, and c4=c, then they must satisfy:
and so its moduli space is an open set of this hypersurface. Moreover, by solving for c, we have that: c=21(ea+e−ad+d±−3(a−1)(d−e)). But, we cannot have a=1 or d=e, and so this shows that the square root of −1 is necessary.
M4: This case is not possible over C. To get the contradiction, we take: [[5,10,13]] solve for c7, [[3,7,15]] solve for
c6, [[2,8,15]] solve for b2, [[4,6,15]] solve for c3, [[5,6,14]] solve for a5, [[1,9,15]] solve for c8, [[1,10,14]]
solve for c1, [[3,8,14]] solve for c2, [[2,10,11]] solve for c4, and [[2,6,13]] solve for b1. At this stage, we obtain several
possibilities from the equation given by [[2,6,13]], none of them possible (for example, a2=a6).
M5: This case is not possible over C. By solving [[5,10,13]] for c7, and then [[3,7,15]] for c6, we obtain a6=a7
which is a contradiction.
M6: This gives a two dimensional moduli space, and so this parameter space are not always three dimensional (see [19, p.
14]). Some of these nets can be defined over R. The order we take is: [[5,10,11]] solve for a5, [[1,9,15]] solve for c8,
[[3,7,15]] solve for c6, [[2,6,15]] solve for b1, [[5,6,13]] solve for c7, [[4,9,11]] solve for b3, [[2,9,13]] solve for
c1, [[1,10,12]] solve for c3, and [[3,9,12]] solve for b2. If b8=b, c2=d, and c4=c, then they must satisfy:
[TABLE]
Thus, its moduli space is an open set of this
hypersurface.
M7: This gives a two dimensional moduli space parametrized by an open set of A2. These nets can be defined over Q. The
order we solve is the following: [[5,6,13]] solve for c7, [[3,6,15]] solve for b2, [[1,9,15]] solve for c8, [[5,9,12]] solve
for c6, [[1,10,14]] solve for b3, [[3,9,11]] solve for b8, [[4,8,11]] solve for c3, [[4,10,13]] solve for c2,
[[4,7,15]] solve for b1, and [[5,7,11]] solve for c1. If a5=a and c4=c, then we have:
M8: This also gives a two dimensional moduli space. Some of these nets can be defined over R. The order we solve is the
following: [[2,6,15]] solve for b1, [[1,10,13]] solve for c7, [[1,7,15]] solve for c6, [[5,7,14]] solve for c8,
[[4,10,11]] solve for c3, [[5,6,13]] solve for b2, [[2,10,14]] solve for b3, [[5,9,11]] solve for a5, and [[3,7,11]] solve
for c1. If b8=b, c4=c, and c2=e, then they have to satisfy:
[TABLE]
Thus, its moduli space is an open set of this hypersurface.
M9: This gives a three dimensional moduli space. Some of them can be defined over R. The order we solve is the following:
[[5,10,11]] solve for a5, [[1,10,14]] solve for c8, [[4,7,15]] solve for c6, [[4,9,12]] solve for b3, [[1,8,15]] solve for
c7, [[5,8,12]] solve for c2, [[5,6,14]] solve for c1, and [[3,6,15]] solve for b2. If b1=e, b8=b, c4=c, and c3=d,
then they have to satisfy:
Thus, its moduli space is an open set of this hypersurface.
M10: This gives a two dimensional moduli space. Some of these nets can be defined over R. The order we solve is the
following: [[5,10,11]] solve for a5, [[1,7,15]] solve for b1, [[1,10,12]] solve for c6, [[3,6,15]] solve for b2,
[[5,6,13]] solve for c7, [[5,7,14]] solve for c8, [[4,8,15]] solve for b3, [[3,7,11]] solve for c3, and [[2,8,11]] solve
for c2. If b8=b, c4=c, and c1=e, then they have to satisfy:
ce(c−2e)+(2ce−c−e)(e−c)b+c(1−e)(e−c)b2=0.
Thus, its moduli space is an open set of this hypersurface.
M11: This also gives a two dimensional moduli space. Some of these nets can be defined over R. The order we solve is the
following: [[5,10,11]] solve for a5, [[1,9,15]] solve for c8, [[3,8,11]] solve for c7, [[3,7,15]] solve for c6, [[4,6,15]]
solve for b3, [[2,8,15]] solve for b1, [[4,9,11]] solve for c2, [[5,7,14]] solve for c3, and [[1,8,14]] solve for c1. An
extra property for this nets is that c7 has to be zero, and so L13, L16, and L18 have always a common point of incidence. If
b2=e, b8=b, and c4=c, then they must satisfy:
c(b−1)(bc−b−c)+(b2c−2bc+c−b2+2b)e−e2=0.
Thus, its moduli space is an open set of this hypersurface.
M12: This case is not possible over C. To achieve contradiction, we take: [[2,9,15]] solve for c8, [[5,10,13]] solve
for c7, [[3,6,15]] solve for b2, [[1,8,15]] solve for c3, [[1,10,12]] solve for c6, [[5,9,11]] solve for c2, and
[[5,6,12]] solve for b1. Then, the equation induced by [[1,9,13]] gives six possibilities, none of them is possible.
(3,8)-nets corresponding to the Quaternion group.
We now compute the (3,8)-nets corresponding to the multiplication table of the Quaternion group.
M=
1
2
3
4
5
6
7
8
2
1
6
7
8
3
4
5
3
6
2
5
7
1
8
4
4
7
8
2
3
5
1
6
5
8
7
6
2
4
3
1
6
3
1
8
4
2
5
7
7
4
5
1
6
8
2
3
8
5
4
3
1
7
6
2
In this case, we have a three dimensional moduli space for them, given by an open set of A3. Also, these (3,8)-nets can be defined over
Q (so we can even draw them). This example shows again that non-abelian groups can also realize nets over C. The set up is similar to what
we did before. In this case, A′=A∖{L1,L9,L17} and P=[[1,9,17]]. Our distinguished points on L(A′,P)⊆P19 are: α=[a1:a2:a3:a4:a5:a6:a7:1:a8:a9:a10:a11:a12:0:1:a8:a9:a10:a11:a12],
β=[1:b1:b2:b3:b4:b5:0:b6:b7:b8:b9:b10:b11:b12:1:b1:b2:b3:b4:b5], and
γ=[1:c1:c2:c3:c4:c5:c6:1:c4:c5:c6:c1:c2:c3:c7:c8:c9:c10:c11:c12]. Let [t:u]∈P1 such that αt+βu=γ. We isolate first a1, a2, a3, a4, a5, a6, a8, a9, a10, a11, b6, b7, b8, b9, b10,
b11, and c7 with respect to the other variables. The following is the order we solve (some of) the 2×2 determinants given by
the 3-points in X′: [[1,11,21]] solve for c10, [[2,10,21]] solve for c9, [[3,12,21]] solve for c11, [[4,8,21]] solve
for b3, [[5,13,21]] solve for c8, [[7,14,15]] solve for b12, [[5,14,20]] solve for c4, [[2,14,17]] solve for c1,
[[4,9,20]] solve for c2, [[6,13,15]] solve for c5, [[3,8,20]] solve for b5, [[3,10,15]] solve for b4, [[3,9,18]] solve for
c6, and [[3,11,19]] solve for b1. Then, if we write a7=a, b2=e, and c3=d, the expressions for all the variables are:
Since b3=2, these (3,8)-nets are not possible in characteristic 2. The lines for these (3,8)-nets can be written as: L1=(y),
L2=(a1x+y+z), L3=(a2x+b1y+z), L4=(a3x+b2y+z), L5=(a4x+b3y+z), L6=(a5x+b4y+z), L7=(a6x+b5y+z),
L8=(a7x+z), L9=(x), L10=(x+b6y+z), L11=(a8x+b7y+z), L12=(a9x+b8y+z), L13=(a10x+b9y+z),
L14=(a11x+b10y+z), L15=(a12x+b11y+z), L16=(b12y+z), L17=(ux−ty), L18=(x+y+z), L19=(a8x+b1y+z),
L20=(a9x+b2y+z), L21=(a10x+b3y+z), L22=(a11x+b4y+z), L23=(a12x+b5y+z), and L24=(z).
A natural question, which we leave open, is the following:
Question 4.1**.**
Is there a combinatorial characterization of the main classes of q×q Latin squares which realize (3,q)-nets in PC2?
Bibliography23
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J. Aczel. Quasigroups, nets, and nomograms , Adv. in Math. 1 (1965) 383-450.
2[2] M. Artebani and I. Dolgachev. The Hesse pencil of plane cubic curves , ar Xiv:math.AG/0611590, to appear on L’Enseignement Mathématique.
3[3] A. Barlotti and K. Strambach. The geometry of binary systems , Adv. in Math. 49 (1983) 1-105.
4[4] M. A. Marco Buzuñariz. Resonance varieties, admissible line combinatorics and combinatorial pencils , ar Xiv:math/0505435.
5[5] O. Chein, H. O. Pflugfelder and J. D. H. Smith. Quasigroups and loops: theory and applications , Sigma Series in Pure Mathematics 8, Heldermann Verlag, Berlin, 1990.
6[6] J. Dénes and A. D. Keedwell. Latin squares and their applications , Academic Press, 1974.
7[7] I. Dolgachev. Abstract configurations in algebraic geometry , The Fano Conference, Univ. Torino, Turin (2004) 423-462.
8[8] C. Dunn, M. S. Miller, M. Wakefield and S. Zwicknagl. Equivalence classes of Latin squares and nets in ℂ ℙ 2 ℂ superscript ℙ 2 \mathbb{C}\mathbb{P}^{2} , ar Xiv:math/0703142 v 4.