Quatroids and rational plane cubics
Abstract.
It is a classical result that there are (irreducible) rational cubic curves through generic points in , but little is known about the non-generic cases. The space of -point configurations is partitioned into strata depending on combinatorial objects we call quatroids, a higher-order version of representable matroids. We compute all quatroids on eight distinct points in the plane, which produces a full description of the stratification. For each stratum, we generate several invariants, including the number of rational cubics through a generic configuration. As a byproduct of our investigation, we obtain a collection of results regarding the base loci of pencils of cubics and positive certificates for non-rationality.
Key words and phrases:
quatroid, rational cubic, matroid, stratification2020 Mathematics Subject Classification:
(primary) 14N10, (secondary) 14E08, 55R80, 14H50, 05B35, 14Q051. Introduction
In this article, we address the following planar interpolation problem:
(Problem 1) |
Famously, the answer to this enumerative problem is whenever the eight points are in generic position (see Figure 1). A modern proof of this classical result follows by an evaluation of Kontsevich’s Formula [21, Claim 5.2.1]. We consider the non-generic cases of Problem 1.

For almost all enumerative problems of interest, the count is known only for generic parameters. Determining the conditions of non-genericity for an enumerative problem is a hefty task; the challenge of describing the solution set over non-generic parameters is more difficult still. Such a full analysis has been achieved for few enumerative problems (e.g. [24]). We advance the understanding of non-generic instances of Problem 1 through combinatorial objects we call quatroids.
The parameter space of Problem 1 is the space of configurations of eight distinct points. We partition into quatroid strata. Each stratum is a locally closed subset indexed by a pair of triples and sextuples of . Those pairs for which is nonempty are called (representable) quatroids. A configuration is in if the triples in index the triples of points in lying on lines, and the sextuples in do so for sextuples of points lying on (irreducible) conics. A similar construction was explored in [13] in the context of M-curves and singular cubic curves interpolating convex configurations of points in .
The quatroids appear in orbits under the natural action of the symmetric group . We compute a representative quatroid of each orbit, along with several of its invariants (see Figure 2). Included in this list is the number of rational cubics through a generic configuration in .
![]() |
|
The main results about the stratification are summarized in the data contained in the Appendix:
- •
- •
-
•
Table 3 lists and describes the auxiliary files used to obtain the results in the paper.
The code and auxiliary files may be found at
Figure 10/ Figure 11 and Table 4/Table 5 contain entries, rather than . These correspond to the orbits of candidate quatroids computed in Section 3. The entry in each describes a collection of linear and quadratic dependencies which cannot be realized by any configuration of eight distinct points in .
An enumerative problem such as Problem 1 can be viewed as a branched cover, in the sense of [3, Section 2.2]. Specifically, let be the projectivization of the space of homogeneous ternary cubics and consider the following two subsets:
It is a classical fact that is an open subvariety of the degree irreducible hypersurface called the discriminant (see, e.g., [16, Example I.4.15]).
Problem 1 pertains to rational cubics, but it is useful to consider the analogous problem for singular cubics. Hence, we consider incidence correspondences
The natural projection maps and define two branched covers over ; clearly is the closure of in and is the composition of the open inclusion map with . With this setup, solving an instance of either enumerative problem over a configuration is the same as computing the fibers or of the respective branched cover.
For fixed , the equations define a linear space on the space of ternary cubics; explicitly, is the projectivization of the homogeneous component of degree of the ideal of the points . If the conditions are linearly independent, then the dimension of is : in this case is a pencil. Hence, singular cubics through correspond to points in and the analysis of is equivalent to the analysis of how pencils of cubics in meet the discriminant hypersurface .
In Section 2 we outline the relevant algebro-geometric geometric facts underlying our analysis of the branched covers and . We focus on the geometry of cubics. We characterize the point configurations for which there are infinitely many singular cubics through p (2.1) as well as those configurations for which there are fewer than rational cubics through p (Theorem 2.5).
Theorem 2.5 forms the main idea behind the stratification of . It states that there are fewer than rational cubics through if and only if p represents a non-uniform quatroid. In Section 3, we define (representable) quatroids (3.1) of eight distinct points in and discuss their relationship to matroids. We compute the set of candidate quatroids , a superset of all quatroids, using algorithm 1. We achieve this by making use of two necessary criteria for to be a quatroid: the underlying matroid is representable and satisfies Bézout’s weak criteria (3.9). For each candidate quatroid , we determine if is representable over , , or . We give explicit representations in the auxiliary file RationalRepresentatives.txt. We show that candidate is not representable over , and as a consequence, we obtain the true list of orbits of quatroids.
In Section 4 we show that all quatroids have irreducible realization spaces except for , which has two irreducible components. This result justifies our use of the word generic when considering points on these strata.
Since the number of rational cubics through a configuration p is upper semicontinuous, counting the rational cubics interpolating any representative configuration in provides a lower bound on the number of rational cubics through a generic point of . This is done in Section 5; specifically, we compute these bounds in Theorem 5.5 using our rational representatives.
In Section 6 we turn toward showing that our lower bounds on each are tight. We compute upper bounds for each by bounding the number of reducible cubics through any configuration , using the multiplicity of each reducible cubic as a point on . Our lower bounds agree with our upper bounds in all but cases (see Theorem 6.3). In these remaining cases, the bound is off by one. We account for this discrepency by showing that configurations which represent any of these quatroid orbits must correspond to lines which are tangent to a branch of through a reducible cubic. Doing so, we achieve our main result Theorem 6.13 of determining .
In Section 7 we collect several immediate consequences of our computations and outline challenges to refining our stratification. We explain how quatroids offer positive certificates for the non-rationality of cubics. In this section, we also compute the number of rational quartic curves through two special configurations using numerical algebraic geometry. Finally, we discuss examples which show that a complete stratification may be within reach, which would fully answer Problem 1.
Remark 1.1.
The computations supporting several of our main theorems were first performed numerically using HomotopyContinuation.jl [7] in julia [4]. This includes
-
•
The computation of generic points on each (nonempty) quatroid stratum.
-
•
The computation of real points on each stratum other than and .
-
•
The computation of for each candidate quatroid
For the sake of accessibility, brevity, and clarity, we decided to list explicit -representatives instead of relying on subtle claims which depend upon numerical certification methods. Ultimately, despite its important role in developing our intuition about the present problem, no proof in this manuscript comes from a numerical computation. We showcase the power of numerical methods in Section 7 when discussing the possibility of extending our results to quartics. ∎
Acknowledgements
We are grateful for the helpful conversations with Lukas Kühne during the early stages of this project. The first author is partially supported by an NSERC Discovery Grant (Canada). The third author is partially supported by DFG Emmy-Noether-Fellowship RE 3567/1-1.
2. Background on Algebraic Geometry and Cubics
In this section, we collect some standard facts about the geometry of points in the plane and cubic curves through them. Let be a configuration of eight distinct points in and be the linear space of cubics vanishing at p. Write for the scheme in defined by the ideal generated by , called the base locus of . A -dimensional subspace of is called a pencil of cubics. Plane curves of degree one, two, and three are called lines, quadrics, and cubics, respectively. An irreducible quadric is a conic and a rational cubic is a singular irreducible cubic.
A classical consequence of Bézout’s Theorem [14, Section 5] guarantees that in the cases of interest for Problem 1 the linear space is -dimensional. We include a proof for completeness.
Proposition 2.1.
Let . The following are equivalent.
-
(1)
The set is finite,
-
(2)
There is an irreducible cubic through p,
-
(3)
No four points of p are on a line and no seven points of p are on a conic,
-
(4)
The residue of the scheme with respect to is a reduced point , called the Cayley–Bacharach point of p.
Proof.
Observe preliminarily that by Bézout’s Theorem, the intersection of two cubics is either of positive dimension or it is a -dimensional scheme of degree in . We show part (2) is equivalent to all others.
Part (1) Part (2): The linear space has dimension at least because it is defined by eight linear conditions on . Hence, if is finite, there exists some , that is, an irreducible cubic through p.
Part (1)Part (2): If the intersection is infinite, then either or .
In the first case, is a pencil of singular cubics. By Bertini’s Theorem [15, p.137] the generic element of is smooth away from the base locus of , so there is a point such that all elements of are singular at . Hence, the fat point supported at is contained in . Since , and the base locus of contains at least additional distinct points, this implies is not a -dimensional scheme of degree and therefore must contain a positive dimensional component. This component is a curve in and all elements of are multiples of the polynomial defining it. The polynomial has degree smaller than three since otherwise is just a point. Hence, contains no irreducible element.
Now suppose . If the points of lie on a line or on a conic, then is generated by the corresponding equation of degree or so it does not contain irreducible elements. Indeed, if contains an equation not generated by the ones of lower degree, then would be contained in a complete intersection of type or , which contains at most points. In particular, we may assume the ideal of has no elements of degree or . We apply [5, Thm. 3.6], and we refer to [8, Thm. 2.3] for a simpler statement: if , and the ideal of contains no elements of degree , then the h-vector of is ; in this case has five points on a line . Let be three linearly independent quadrics vanishing on the (at most) three points of not lying on , then . As before, this shows that all elements of share a common factor.
Part (2)Part (3): By Bézout’s Theorem, an irreducible cubic contains no four points on a line or seven on a conic.
Part (3)Part (2): We showed above that if then either lies on a line or a conic, or at least five elements of lie on a line. Therefore, assume and suppose all of its elements are reducible. We will show that has at least four points on a line or at least seven on a conic. As before, by Bertini’s Theorem, all elements of have at least one common singular point, and we deduce that either a line or a conic is contained in the base locus of .
Suppose the line is a line in the base locus so that . We consider two cases. If is -dimensional, then it contains at most four points of , and at least four points of lie on . If is positive dimensional then and : then , so that at least four points lie on a line.
Suppose the conic is a conic in the base locus, so that . Then , showing that at least seven points lie on a conic.
Part (2)Part (4): This is the classical Cayley–Bacharach Theorem. If contains at least one irreducible element, then the base locus of is a -dimensional scheme of degree . The residue is, by definition, cut out by the ideal , where denotes the ideal generated by the cubics of . Since , and consists of points with , we have that the degree of the residue is . This shows that it is a reduced point .
Part (4)Part (2): If the residue is a reduced point, then is -dimensional. In this case, the same arguments used above show that the generic element of is an irreducible cubic. ∎
A consequence of 2.1 is that if either is not a pencil, or if , then there are no rational cubics through . When is a pencil intersecting in finitely many points, write for the intersection multiplicity of and at a point (see [14, Section 3]): in other words, is the degree of the component supported at in the -dimensional scheme . The related concept of the multiplicity of a point is defined as follows:
(1) |
where is the Grassmannian of projective lines in . By a semicontinuity argument, a generic line through realizes .
Our main interest for this work is the following quantity. Recall that is the subset of consisting of irreducible cubics.
Definition 2.2.
For , define
to be the number of rational cubics through p counted with multiplicity.
The following is a direct consequence of 2.1.
Corollary 2.3.
For the value is finite.
The set-difference of and is comprised of the reducible cubics through p. Taking intersection multiplicity into account allows for a stronger correspondence. Hence, for any satisfying the conditions of 2.1, we define
If fails to satisfy the conditions in 2.1, we set . The following proposition justifies this convention and expresses how measures the difference of and .
Proposition 2.4.
Proof.
If p satisfies 2.1, then is a line and is finite. Since is a projective hypersurface of degree , the intersection is a -dimensional scheme of degree . This shows the left equality. The middle equality follows from the definition of . The last equality is the definition of . The final statement follows from 2.1. ∎
2.4 answers the problem of counting (with multiplicity) the singular cubics through eight distinct points: when finite, this number is . The main insight of 2.4 is that the number is determined as the difference , and is the number of reducible cubics through p counted with multiplicity. This main idea anchors our story.
Theorem 2.5.
Let . The following are equivalent:
-
(1)
Either p has three points on a line or six points on a conic,
-
(2)
There is a reducible cubic through p, i.e. ,
-
(3)
The inclusion is strict,
-
(4)
Counted with multiplicity, there are fewer than rational cubics through p, i.e. .
Proof.
If is infinite, the result follows directly from 2.1. Hence, suppose that is a pencil and is finite.
Part (1)Part (2): If p has three points on a line then the union of and a conic through the remaining five points is a reducible cubic through p. Similarly, if six points are on a conic, then the union of that conic and the line containing the other two is a reducible cubic through p. Conversely, if there is a reducible cubic through p, the pigeonhole principle implies that either three are on a line or six are on a conic since reducible cubics are either unions of three lines or a line-conic union.
Part (2)Part (3): This is immediate from the definitions. Part (4)Part (3): Since the fibre is finite, by 2.4 it consists of cubics counting multiplicity. From the hypothesis, does not, so part (3) is true.
Part (2) Part (4): Since the fibre is finite, consists of points counting multiplicity by 2.4. Since part (2) is true, at least one cubic in is reducible, and so there are fewer than rational cubics through p counting multiplicity. ∎
3. Quatroids
As a consequence of the results in the previous section, any configuration admitting fewer than rational cubics must lie on at least one of the following two types of hypersurfaces in :
Elements of the intersection lattice of these hypersurfaces are indexed by pairs of triples and sextuples of . Define
where the union ranges over all such that .
By construction, the stratification of nonempty loci partitions the parameter space . The strata, and thus their indices, are naturally ordered by if and only if .
With this setup, we introduce the main combinatorial object of interest. Although we focus on fields of characteristic zero, we give the definition for any field . Write for the open subset -tuples of distinct points in .
Definition 3.1.
Let be a field and let and be collections of triples and sextuples of , respectively. The pair is a (-representable) quatroid if there exists a configuration such that . In this case, we say is representable over . Equivalently, there exists such that
-
•
Every triple of points in p indexed by an element of lies on a line,
-
•
Every sextuple of points in p indexed by an element of lies on a conic,
-
•
No other triple of points in p lies on a line,
-
•
No other sextuple of points in p lies on a conic.
Such a configuration p is said to represent over . The set is called the realization space of over .
For any and we write for the line through and for the conic through when such a curve exists and is unique. Given a configuration p satisfying any condition in 2.1, the quatroid represented by p exactly tracks the reducible cubics through p, as detailed in the following result.
Lemma 3.2.
Let p be a configuration satisfying 2.1 and representing a quatroid . A reducible cubic through p has one of the forms:
-
(a)
for ,
-
(b)
for disjoint ,
-
(c)
for .
Proof.
If there is a reducible cubic through p, by the pigeonhole principle, and 2.1, either exactly six points of lie on a conic or exactly three points of lie on a line.
In the first case, the reducible cubic must be the union of the conic containing six points and the line containing the remaining two. The six points on the conic must be indexed by some , so the reducible cubic has the form (c).
In the second case, the reducible cubic must be the union of the line containing three points and the quadric containing the remaining five. Following a similar argument as in the first case, if the quadric is a irreducible, then the cubic has the form (a) and otherwise it has the form (b). ∎
Remark 3.3.
An consequence of 3.2 is that the ordering may be expressed combinatorially. Given our conventions, the full characterization is rather technical. However, we list two simple sufficient conditions:
-
(a)
if and ,
-
(b)
if and , where denotes the set of subsets obtained as union of two elements of .
Condition (b) completely characterizes restricted to a class of quatroids called Bézoutian quatroids defined in 3.15. ∎
We now digress into several remarks on the choice of the term quatroid.
Remark 3.4 (Inspiration for the term).
The term (representable) quatroid is inspired by the term representable matroid. Quatroids partially extend the concept of matroids; representable matroids encode the affine linear dependencies among points, whereas representable quatroids track linear and quadratic dependencies. There are several standard references for matroids. We suggest [28]. ∎
Remark 3.5 (Abstraction of quatroids).
There are several natural ways to extend 3.1 to include point configurations with more points or in higher dimensional spaces. We use the specific definition in 3.1 for the sake of brevity since this is all we need for the purpose of the paper. We leave the challenge of defining a non-representable quatroid for future work. If is not a quatroid, we merely call it a pair. ∎
Remark 3.6 (Pascal’s Theorem to linearize conic conditions).
Pascal’s Theorem states that six points are on a conic if and only if the three auxiliary intersection points of a hexagram as shown in Figure 3 lie on a line, called the Pascal line. One may attempt to convert conic dependencies into linear dependencies using Pascal’s Theorem. This result may be applied to orderings of the six points, introducing hexagram lines, auxiliary points, and Pascal lines. The right-hand image in Figure 3 illustrates a fraction of how complicated the entire arrangement gets, and thus, the benefit of recording the conic conditions directly. ∎


Remark 3.7 (Simplicity).
Our definition of a quatroid requires that a representative point configuration p consists of distinct points. Such a restriction for matroids means that the matroid is simple: the matroid has no parallel elements (repeated points) and the matroid has no loops (consists of points in ). We suspect that an effective definition of quatroid which covers the case of repeated points would need to involve additional information about this repetition. Possibly, there is a way to combinatorially track some information encoded in the Hilbert scheme of eight points in . ∎
Remark 3.8.
For the remainder of this article, we assume that is , , or . ∎
Given 3.1, a natural question emerges:
Which pairs are representable quatroids?
We address this problem by providing two necessary conditions on to be a quatroid, finding all satisfying those conditions, and subsequently identifying which of those candidates are quatroids by either exhibiting an element representing it or proving that no such exists.
3.1. Necessary conditions for being a quatroid
The underlying matroid of a quatroid is the matroid whose nonbases of size three are given by . The realization space of is because if represents , then it represents as well. The matroid is representable if is nonempty. We call a pair matroidal whenever is representable. A representable quatroid is necessarily matroidal. Additional necessary conditions for to be representable rely upon Bézout’s Theorem.
Definition 3.9.
A pair satisfies Bézout’s weak criteria if
-
(1)
“A line and conic meet in at most two points”:
-
(2)
“Two lines meet in at most one point”:
-
(3)
“Two conics meet in at most four points”:
Example 3.10.
The pair satisfies all of Bézout’s weak criteria. The pair satisfies the first and (vacuously) the third of Bézout’s weak criteria, but not the second. The pair does not satisfy the first of Bézout’s weak criteria. By adding additional triples to , one may obtain the pair which does satisfy all of Bézout’s weak criteria. This procedure is impossible for pairs such as which fail Bézout’s first weak criterion. ∎
Lemma 3.11.
If is representable, then is matroidal and satisfies Bézout’s weak criteria.
Proof.
A representable quatroid is, by definition, matroidal. The proof that a representable quatroid satisfies Bézout’s weak criteria is suggested by the quotations preceding each criterion in 3.9 as detailed below.
Suppose represents . For every , , the line and the conic meet in at most two points of by Bézout’s Theorem. Therefore, satisfies the first weak criterion. Similarly, if , then meet in at most one point of , unless . If , then any three points of lying on such line is indexed by a triple in . This shows that must satisfy the second weak criterion. The proof for the third criterion is similar. ∎
Motivated by our goal of computing all quatroids, and inspired by Bézout’s weak criteria, we introduce the following operation on pairs.
Definition 3.12.
Let be a set of triples of . Define to be the smallest set of triples containing which satisfies Bézout’s second weak criterion. Similarly, for a set of sextuples of , define to be the smallest set of sextuples containing which satisfies Bézout’s third weak criterion. For a pair , define .
Lemma 3.13.
The sets and are well-defined, and thus so is .
Proof.
Let be a set of triples of . The definition of is the smallest set of triples containing which satisfies Bézout’s second weak criterion. This set is not empty since the set of all triples of contains and satisfies the second criterion. Moreover, if and both satisfy Bézout’s second weak criterion, then so does their intersection, proving that the smallest such set of triples is well-defined. The argument for sextuples is exactly the same. ∎
Example 3.14.
Consider the pair . Then
Note that satisfies the first and third weak criteria, but not the second. On the other hand satisfies the second and third weak criteria, but not the first. ∎
When a configuration is contained in an irreducible cubic, Bézout’s Theorem applied to such a cubic restricts which lines and conics pass through subsets of . This motivates the following definition.
Definition 3.15.
A pair satisfies Bézout’s strong criteria if
-
(1)
“An irreducible cubic meets a line in at most three points”:
-
(2)
“An irreducible cubic meets a conic in at most six points”:
Pairs which satisfy both Bézout’s weak and strong criteria are called Bézoutian.
As with the weak criteria, the quotes suggest the proof of an important result.
Lemma 3.16.
A configuration satisfies the conditions of 2.1 if and only if p represents a Bézoutian quatroid. Hence, there are no rational cubics through a configuration p that represents a non-Bézoutian quatroid.
Proof.
Let denote the quatroid represented by . By 3.11, satisfies Bézout’s weak criteria. Suppose p satisfies the conditions of 2.1. Then there is an irreducible cubic through p and so no four points of p lie on a line and no seven lie on a conic. As suggested by the quotations in 3.15, this implies the strong criteria are satisfied: if for some then at least four points of lie on the line which is a contradiction. The proof for the second criterion is similar.
Conversely, suppose p represents a Bézoutian quatroid . Then no four points of p lie on a line and no seven lie on a conic and so p satisfies the conditions in 2.1. To see this, suppose towards a contradiction that lie on a line: then so Bézout’s first strong criterion is violated. A similar conclusion holds if seven points lie on a conic. ∎
3.2. Computing all candidate quatroids
We approach the task of computing all quatroids by first computing a list of candidate quatroids. A pair is a candidate quatroid if it is matroidal and satisfies Bézout’s weak criteria. By 3.11, all (representable) quatroids are in .
Remark 3.17.
Our goal is to count rational cubics through , so by 3.16 it is enough to determine all Bézoutian quatroids. However, for completeness, we compute all quatroids. ∎
Since matroidal pairs have underlying representable matroids, we take advantage of existing databases of matroids to begin our computation. We use the database [23], to compile a list of matroids representable by eight distinct points in . These are the representable simple matroids of rank at most three. There are orbits of such matroids, under the action of : of rank three and of rank two. In this work, we record matroids in terms of their nonbases of size three. The original list from [23] is in the auxiliary file SimpleMatroids38.txt.
We now give an algorithm which produces all candidate quatroids with a given underlying matroid by greedily extending its the conic conditions.
Theorem 3.18.
The set of pairs produced by algorithm 1 on the input coincides with the set of candidate quatroids whose underlying matroid is . Thus, applying algorithm 1 to every matroid in produces .
Proof.
Clearly all pairs in the output of algorithm 1 on the input are candidate quatroids whose underlying matroid is . We need to show that all candidate quatroids arise in this way. We ignore the parenthetical steps of algorithm 1, which are used only to speed up the process by working modulo the -action.
By contradiction, assume is a candidate quatroid which is not in the output of algorithm 1 applied to . Let be a maximal candidate quatroid which is generated by algorithm 1 with . Let .
The first time is found in algorithm 1, it is placed in PairsToExtend at step 12. Therefore, it is then chosen in step 5 and the pair is one of the elements of Q’_Extensions at step 6. When is chosen in the for loop at step 7, it satisfies the if condition at step 8, because guarantees satisfies Bézout’s weak criteria. Hence, is a candidate quatroid and it is produced by algorithm 1. This contradicts the maximality of . ∎
Theorem 3.19.
The list of candidate quatroids consists of pairs. Up to the symmetry of , these occur in distinct orbits. The numbers of orbits of each size are tallied below:
Orbit Size | 1 | 8 | 28 | 35 | 56 | 70 | 105 | 168 | 210 | 280 |
---|---|---|---|---|---|---|---|---|---|---|
# Orbits | 3 | 2 | 2 | 1 | 3 | 1 | 1 | 3 | 2 | 3 |
Orbit Size | 420 | 560 | 840 | 1680 | 2520 | 3360 | 5040 | 6720 | 10080 | 20160 |
# Orbits | 2 | 1 | 13 | 4 | 10 | 13 | 17 | 6 | 22 | 17 |
Proof.
The candidate quatroids are computed by calling algorithm 1 on all representable matroids . This computation may be performed by calling the function AllConicExtensions(M) in the Quatroids.jl package (see Table 3 for details). All candidate quatroids are produced by the function GenerateAllCandidateQuatroids() and the results are automatically stored in a text file. The function OrbitSizes() then produces a text file listing the corresponding orbit sizes. These functions use features from GAP [17] and OSCAR [26] to work modulo the -symmetry. ∎
3.3. Representability of Quatroids
A candidate quatroid is a quatroid if and only if it is representable. In order to compile a list of quatroids, for every candidate quatroid , we either exhibit an element representing it, or we prove that the realization space is empty.
Theorem 3.20.
Every is representable over except for the ones in the -orbits of
Those in the orbit of are representable over but not over . Those in the orbit of are not representable over .
Proof.
The following corollary combines Theorem 3.19 and Theorem 3.20.
Corollary 3.21.
Of the pairs ( orbits) in , exactly ( orbits) are representable over and ( orbits) are representable over and . In particular, the stratification of consists of strata, ( orbits) of which are Bézoutain.
To complete the proof of Theorem 3.20, we show that is representable over and not over , and that is not representable. To analyze we extend a standard matroid procedure to put coordinates on the realization space of a quatroid.
We represent an element as a matrix, whose columns correspond to elements of . We are free to work modulo the action of on ; it is convenient to normalize either some of the points of or some of the conic conditions of , leaving some free parameters . These parameters are free to vary in a quasi-projective variety described by equations and inequations. The equations are determinantal relations imposed by , some of which are identically satisfied after the normalization. The inequations are the determinantal relations not imposed by . The realization space is a bundle over . In particular, is representable if and only if is nonempty and is irreducible if and only if is.
Candidate quatroid is a well-known matroid called the MacLane matroid (see, e.g., [20, 32]) which is realized by a Möbius-Kantor configuration [11, Section 2]. As a matroid, it is non-orientable, not representable over , and its realization space is reducible. We give a standard proof regarding its representability.
Lemma 3.22.
The candidate quatroid is representable over but not . Its realization space is the union of two distinct orbits of .
Proof.
The four points are in general linear position, in the sense that no subset of three of them lie on a line. Therefore, we may normalize them with the action of to be the four points and in . Using the fact that , we deduce for some and similarly, we write and using the linear relations , respectively, and in this order. We obtain the representation of as the matrix
subject to the determinantal equations imposed by . Conditions and imply that . Condition implies that . Finally, implies that the last remaining parameter, , satisfies the univariate quadratic equation , which has two distinct non-real solutions. For either solution, the inequations hold. Hence the set consists of two points. Since the two points are inequivalent for the action of , the two corresponding -orbits give rise to two disjoint irreducible components of . ∎
We now change focus to the non-representability of . Our proof relies on the following property: for any realization of , the base locus is reduced. Hence, the matroid underlying the base locus is determined by (see 3.23) and if such a matroid is non-representable, then is non-representable as well.
A priori the Cayley–Bacharach point of a configuration p of cubics may coincide with one of the eight points in p. In this case the variety underlying the base locus consists of eight points, but as a scheme, it contains a nonreduced component of degree two supported at the Cayley–Bacharach point. See, for example, Figure 4.

Lemma 3.23.
Let be a Bézoutian candidate quatroid and let . If for every in the orbit of , then the Cayley–Bacharach point of cannot coincide with any point involved in a line condition or conic condition .
Proof.
Without loss of generality, assume . Since is Bézoutian, the base locus is -dimensional by 2.1 and 3.16. Let be the Cayley–Bacharach point of . By 3.3, we have that , and so we prove that if for some involved in a triple or sextuple of , then either or .
Suppose coincides with for some involved in a conic condition . Without loss of generality, and . Then is a reducible cubic containing , hence . By Bézout’s Theorem, the conic cannot contain the five points and a scheme of length two supported on : if this was the case, the intersection of with an irreducible cubic in would have degree (at least) . Hence, contains . Therefore .
Now, suppose that coincides with for some in a line condition . Suppose for any ; if this is not the case, then as in the previous case. Without loss of generality and . Then is a reducible cubic containing , hence . Similarly to the previous case, by Bézout’s Theorem, the line does not contain the subscheme of of length two supported at . Hence, the quadric contains . Since does not contain a conic condition involving , the quadric must be the union of two lines. Up to reordering the points, those two lines are and implying that . ∎
Corollary 3.24.
If the base locus of is a reduced -dimensional scheme, then for any sextuple , the points lie on a quadric if and only if lie on a line.
A candidate quatroid is called exhaustive if every is involved in some or . 3.23 has the following strong consequence.
Corollary 3.25.
Let be an exhaustive Bézoutian quatroid such that for every in the orbit of . Then for every , the base locus is reduced.
3.25 says that there exist quatroids for which every realization gives a reduced base locus. We say that these quatroids, themselves, have reduced base locus. In this case, knowing the matroid underlying the reduced base locus of the pencil of cubics is equivalent to knowing the quatroid underlying any -subset of the base locus by 3.24.
Lemma 3.26.
The pair is not -representable.
Proof.
Suppose towards a contradiction that represents . Note that is Bézoutian, exhaustive, and for every in the orbit of . By 3.24, has reduced base locus and the matroid underlying , as represented by nonbases, is
This is the Fano matroid, which is famously not -representable [28, Prop. 6.4.8]. Hence is not -representable. ∎
Inspired by the proof of 3.26, we name the Fano candidate.
4. Irreducibility of quatroid strata
In this section, we establish which realization spaces of quatroids are irreducible.
Theorem 4.1.
For every quatroid except those in the orbit of , the realization space is irreducible. If is in the orbit of , then is the union of two irreducible components.
The statement for has been shown in 3.22. The rest of the proof of Theorem 4.1 is built on a series of reductions, inspired by [9, Thm. 4.5]. To state them precisely, we introduce a definition.
Definition 4.2.
Let be a quatroid and let . The deletion of from is
Proposition 4.3.
Let be a quatroid and . Suppose one of the following conditions holds:
-
•
is in at most two elements of and no elements of ,
-
•
is in at most one element of and no elements of .
Then is irreducible if and only if is irreducible. In particular, if and then is irreducible.
Proof.
First, notice that if appears in no elements of and , then . Hence, we may assume appears in at least one element of . Without loss of generality, let .
Suppose first belongs to exactly one element of , say . Let be the projection on the first seven factors. Let . First, observe is a dense subset of : indeed, the line and conic conditions of are the line and conic conditions of not involving , so they are satisfied by if and only if . In particular, is irreducible if and only if is irreducible. Moreover, is an open dense subset of a -bundle over , embedded in : the fiber over is an open subset of the line . In particular, is irreducible if and only if is irreducible.
If belongs to exactly one element , the proof is similar. Suppose . The proof follows the same argument described above, with the only difference that is an open subset of a fiber bundle over whose fiber at is the conic .
If belongs to two exactly two elements , suppose without loss of generality and . Again, the proof is similar. In this case is birational to , with a birational map given by defined by where . ∎
A second reduction is built on the Cayley–Bacharach construction introduced in Section 3. Let be an exhaustive Bézoutian quatroid such that for every in the orbit of , and let be any of its realizations. Then is reduced by 3.25. The underlying matroid of is well-defined by 3.24 and so is the set of quatroids obtained by deleting any of the nine points. If is one such quatroid, write and say that is a modification of .
Lemma 4.4.
Let be quatroids with . If is irreducible then so is .
Proof.
Let and write for the matroid of the base locus for any . Consider the realization space of that matroid. The variety is isomorphic to the variety of configurations which are complete intersections of type . Since is assumed to be irreducible, the map from to given by forgetting one of the nine points shows that is birational to . ∎
Based on these results, given a quatroid , there are four ways to reduce the problem of determining irreducibility of :
-
(i)
reduces to with involved in at most two line conditions and no conic condition,
-
(ii)
reduces to with involved in no line condition and one conic condition,
-
(iii)
has at most six line conditions and no conic condition,
-
(iv)
.
In these cases, if is irreducible, so is .
Lemma 4.5.
All quatroids in orbits other than the orbits represented by
have irreducible realization spaces.
Proof.
The result is obtained by iteratively applying reductions (i)–(iii). The proof is computational and the reductions are performed by the function QuatroidReductions() in the Quatroids.jl package. This function produces the file ReductionProofs.txt. ∎
Lemma 4.6.
The following relationships hold
In particular, the realization spaces of the quatroids in the same orbits as
are all irreducible.
Proof.
All quatroids in the statement satisfy the conditions of 3.25: this is verified computationally, see Table 3. The relation is also verified computationally via the function Modifications(Q) in the package Quatroids.jl. Note that each quatroid on the right-hand-side of a sign, other than , has already been shown to have irreducible realization space, therefore 4.4 guarantees that the corresponding quatroids on the left-hand-side have irreducible realization spaces. ∎
The following result completes the proof of Theorem 4.1.
Theorem 4.7.
The realization spaces of quatroids
are irreducible.
Proof.
The auxiliary files include Macaulay2 scripts to reproduce the computations in this proof.
We normalize elements of the realization space in two different ways. Either we normalize a conic conditions to be and then three points on such conic to be , or we normalize four points in to be . After this normalization, a point in the realization space of quatroid is represented by one of the following matrices:
where the vectors are subject to the determinantal relations imposed by the line and conic condition of a quatroid.
We verify in the auxiliary files that the additional conditions cut out an irreducible variety. To prove irreducibility, we reduce to a hypersurface case. To prove irreducibility of a hypersurface, we observe that its singular locus has codimension at least three (in the ambient space). ∎
That every quatroid stratum other than is irreducible guarantees that the notion of generic point makes sense on these strata. For , one may perform every computation exhaustively, since up to the -action, this realization space is just two complex conjugate points.
5. The generic number of rational cubics through quatroid strata: a lower bound
Recall from 2.2 that for the value is the number of rational cubics through p, counted with multiplicity. The irreducibility of a realization space guarantees that this number is constant on a dense open subset of . Denote by this generic value. Our goal is to compute for all quatroids.
In the case of , it is classically known that, for every , . Indeed, the singular cubics on the pencil are four fully reducible cubics each of the form with linearly independent. We refer, for instance, to [2] for details.
Let be the set of Bézoutian quatroids. By 2.1, if , then . For Bézoutian quatroids, we obtain a lower bound on via a semicontinuity argument.
Lemma 5.1.
The function is lower semicontinuous.
Proof.
By 2.4, is either infinite, in which case , or a -dimensional scheme of degree . The number counts, with multiplicity, the number of intersection points not occurring on the variety of reducible cubics. Equivalently is the degree of the subscheme of supported on the subvariety of reducible cubics. Since this subvariety is closed, upper semicontinuity of follows and we conclude that is lower semicontinuous. ∎
Corollary 5.2.
Let be a quatroid. The number is well-defined and equal to . In particular, for any we have that . Consequently, if .
A consequence of 5.2 is that any point provides a lower bound . We compute the number for the rational representatives in RationalRepresentatives.txt using a symbolic calculation. We now discuss how to perform that calculation.
Lemma 5.3.
Let be a rational representative of a Bézoutian quatroid. Let be a reducible cubic through p defined by a cubic form . Then and it factors over .
Proof.
Since is a reducible cubic, then is a union of either (a) three lines or (b) a line and a conic. In case (a), since p represents a Bézoutian quatroid, then each line contains (at least) two elements of by the pigeonhole principle. In particular, since is rational, each of the three lines has a rational equation. Similarly, in case (b), since p is Bézoutian, the pigeonhole principal implies that there are at least two points on the line and at least five points on the conic. The equation of a conic through five rational points, as well as the equation of a line through two rational points, has rational coefficients. Consequently, in either (a) or (b), the components of must be realized by rational forms whose product is , up to scaling. ∎
algorithm 2 uses 5.3 to find the reducible cubics, and their multiplicities, on a pencil.
Proposition 5.4.
algorithm 2 is correct, in the sense that its output is the number . Moreover, the optional steps correctly determine the multiplicities of each cubic through p and the type of each reducible cubic in the sense of Table 1.
Proof.
Consider a rational configuration for a Bézoutian quatroid . By 2.1, and since is rational the cubics can be taken to have rational coefficients. Step parametrizes the pencil and evaluates the discriminant of plane cubics, , on it. By the separability of , no irreducible factor has a multiple root, and so the multiplicities of the linear factors over are witnessed by the powers of the irreducible factors over . This shows that the first optional step correctly detects the multiplicities.
By 5.3 the reducible cubics through rational configurations are themselves defined over , hence all of them appear in the -factorization of as linear factors. Moreover 5.3 also states that the -factorization of each such reducible cubic is realized over . Consequently, those which factor nontrivially are precisely the reducible cubics on , counted with the appropriate multiplicity, and so their number is . Since , the number is correctly determined. The type of each individual reducible cubic may be determined in several elementary ways. In countReducibleCubics.m2, we determine the type via their singular locus. ∎
Theorem 5.5.
The following numbers are lower bounds for , where is a Bézoutian quatroid:
|
1 | 2 | 3 | 4 | 5 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 24 | |||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
12 | 10 | 8 | 6 | 4 | 10 | 8 | 9 | 6 | 7 | 4 | 8 | 6 | 6 | 7 | 4 | 4 | 5 | 2 | 6 | |||
25 | 26 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | ||||
|
4 | 5 | 4 | 3 | 2 | 1 | 0 | 0 | 2 | 1 | 1 | 3 | 2 | 2 | 1 | 0 | 3 | 3 | 4 | 5 | |||
46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 64 | 65 | 66 | ||||
|
3 | 4 | 4 | 2 | 4 | 2 | 3 | 1 | 6 | 4 | 5 | 2 | 3 | 0 | 4 | 2 | 0 | 5 | 3 | 1 | |||
67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 80 | 81 | 82 | ||||||||
|
5 | 6 | 4 | 7 | 5 | 6 | 3 | 6 | 4 | 2 | 8 | 6 | 9 | 7 | 5 | 3 |
Moreover, for each rational representative , the irreducible cubics through all appear with multiplicity one and the reducible cubics are either conic+secant lines or triangles (see Table 1).
Proof.
For each quatroid , with , we apply algorithm 2 to the -representative in RationalRepresentatives.txt. 5.2 implies the results are lower bounds for . The optional steps are taken to determine the types and multiplicities of all cubics. ∎
Example 5.6.

We detail algorithm 2 on the representative
of . A basis for the ideal of in degree is given by the cubics
Evaluating the cubic discriminant on the pencil and factoring it yields
We see that there are at most three reducible cubics which occur with multiplicity and at most one reducible cubic occurring with multiplicity . Since the nonlinear factor appears with multiplicity one, its factors appear with multiplicity one as well. By factoring for we see that all these cubics are reducible:
The first is the union of three lines with no mutual intersection (i.e. a triangle). The remaining three reducible cubics are conic+secant lines. As a result, . We display the configuration p and these reducible cubics in Figure 5. ∎
6. The generic number of rational cubics through quatroid strata: an upper bound
In this section, we construct upper bounds for each , and observe that they coincide with the lower bounds listed in Theorem 5.5. Bounding from above is equivalent to bounding from below, for every . The value occurs as a sum of intersection multiplicities, which is bounded by a sum of multiplicities in the sense of (1):
(2) | ||||
Hence, we obtain the bound . Define .
Lemma 6.1.
Let be a Bézoutian quatroid. The value is well-defined and equal to for generic .
Proof.
The statement follows from the fact that the multiplicity of a point on a variety is an upper semicontinuous function of the point. ∎
With these definitions, we can bound from above:
(3) |
The value may be thought of, for now, as an expected number of rational cubics through .
6.1. An upper bound for through multiplicities of reducible cubics
Equation (3) gives us a way to compute upper bounds for . Crucially, as shown in 3.2 a Bézoutian quatroid determines the reducible cubics through any of its representations, and hence the range of the summations in (2). In this section, we determine the values of the summands.
The multiplicity of a reducible cubic on the discriminant is invariant under the action of on . Hence, the contribution of a reducible cubic to the number only depends on the orbit of under this action. The characterization of these orbits is classical; we refer to [22] for a modern reference. For each orbit, we record in Table 1 its name, a representative , and the multiplicity . We refer to Section 6.2 for a proof of these multiplicities (see 6.8). Each orbit as well as the orbit-closure containments are illustrated in Figure 6.
Name | Representative | Multiplicity |
---|---|---|
Nodal Cubic | ||
Cuspidal Cubic | ||
Conic+Secant Line | ||
Conic+Tangent Line | ||
Triangle | ||
Asterisk | ||
Double Line + Transverse Line | ||
Triple Line |
A consequence of Theorem 5.5 along with the orbit-closure containments of singular cubics, imply that each reducible cubic through a generic configuration of a Bézoutian quatroid stratum is either a triangle or a conic+secant. In light of this fact, we associate to each quatroid stratum a string of symbols of the form which indicates that a generic representative of is contained in reducible cubics of the form conic+secant, and triangles. These are listed, in black font, in the column Reducibles of Table 4 and Table 5.
Theorem 6.2.
Let be a Bézoutian quatroid. Then
Proof.
The proof is an overcount along with a justification of correction terms. For each triple and each sextuple, we count two under the erroneous assumption that every triple and sextuple gives rise to its own conic+secant pair, which by Table 1 has multiplicity two. This accounts for the first two summands. We have directly overcounted conic+secant pairs by the third summand.
The fourth and fifth summands cover the cases when the triple did not give rise to a conic+secant, but rather, a triangle. In one case, two of the three lines of that triangle were counted by , contributing a total of to , which should have been a by Table 1. Hence the fourth summand corrects for this. The other case is when all three lines of the triangle were counted by , in which case the fourth summand reduced the contribution from to , and the fifth and final summand corrects this contribution to ; this correction term only counts once. ∎
Theorem 6.3.
For all the numbers computed by Theorem 5.5 agree with the numbers except for the following quatroid orbits
In the above cases, the number is precisely one more than the associated number in Theorem 5.5.
Proof.
The number is easily computed via the formula in Theorem 6.2. ∎
That the bound from Theorem 6.2 only fails to be an equality by at most one is a stroke of luck. Consequently, it is enough to show that for each of these quatroids, a configuration p represents it only if for some reducible through p.
6.2. A tighter bound for through tangent cones of reducible cubics
The expected count of rational cubics through generic fails to be correct when the line intersects at some reducible with intersection multiplicity greater than . Such lines are characterized by the tangent cone to at .
Definition 6.4.
The tangent space to at is the union of lines for which
and is denoted . The tangent cone to at is the union of lines for which
and is denoted . Such lines are said to be tangent to at .
Remark 6.5.
For we let be the hyperplane of cubics which vanish at . The description of tangent spaces at smooth points of the discriminant is classical.
Remark 6.6.
A point is a smooth point of if and only if it is a nodal cubic. If is smooth on and is the node of then
For details, see [12, Example 1.2.3]. ∎
Table 2 extends the tangent cone description of 6.6 beyond nodal cubics. Write for the hyperplane counted with multiplicity . Moreover, if is a linear form, write for the subset of of cubics whose intersection with the line is singular.
Proposition 6.7.
The information in Table 2 is correct.
Proof.
The Macaulay2 script tangentConesPlaneCubics.m2 proves the result symbolically. ∎
Cubic Orbit | Curves | Points | Tangent Cone |
---|---|---|---|
Nodal Cubic | : the node of | ||
Cuspidal Cubic | : the cusp of | ||
Conic+Secant Line | : conic, : line | ||
Conic+Tangent Line | : conic, : line | ||
Triangle | : lines | ||
Asterisk | : lines | ||
Double Line+Transverse Line | : double line, : line | ||
Triple Line | : line |
Remark 6.8.
By definition, the multiplicity of a point on the discriminant is the same as the multiplicity of on . Since is a cone over , the multiplicity of in coincides with the degree of . Hence one may take the Tangent Cone column of Table 2 as the proof of the Multiplicity column of Table 1. We remark that has degree four since it is a cone over the variety of singular binary cubics. ∎
Corollary 6.9.
Let . The pencil is tangent to at if and only if is singular at one of the points in p.
Proof.
This follows from the characterization of the tangent cones given in Table 2. ∎
Proposition 6.10.
If p represents for where is in the same orbit as , then tangent to the discriminant. Conversely, if p is a generic point on for some for every in the orbit of , then is not tangent to the discriminant.
Proof.
Without loss of generality, assume . Recall that and observe that is a reducible cubic through any realization. It is singular at and so is tangent to at . Conversely, for all other quatroids, note that the computed from Theorem 5.5 agrees with as computed in Theorem 6.3. Therefore, and the result follows. ∎
Proposition 6.11.
Let represent a Bézoutian quatroid. The following are equivalent:
-
(1)
is tangent to ,
-
(2)
There exists a cubic which is singular at a point of p,
-
(3)
The base locus is nonreduced, with one component of length exactly two,
-
(4)
.
Proof.
The equivalence of parts (1) and (2) is 6.9. The equivalence of parts (1) and (4) follows directly from the definitions of multiplicity and tangent cone.
If part (2) is true, then so is part (3) since a singular point on a cubic has multiplicity at least two, and thus intersects any other cubic of in a scheme of length at least . That scheme has length exactly two, because eight points of the base locus are necessarily distinct. To see that part (3) implies part (2), note that if the base locus is not reduced, then all cubics in have the same tangent at some point in p. Up to the action of , assume and write the equations of two cubics as and where is the tangent line of and at and involves subquadratic terms in . The cubic is singular at . ∎
Corollary 6.12.
Let be a Bézoutian quatroid. The base locus is nonreduced for every if and only if for some in the orbit of .
We conclude this section by summarizing the results we proved before and completing the proof of the main results of the paper.
Theorem 6.13.
Proof.
As this is the main result of the paper, we summarize the steps we took to achieve it.
For each representable quatroid , we found an explicit representative and applied algorithm 2 to p to compute the number of rational cubics through that representative. This gave the lower bound , as shown in Theorem 5.5. Along the way, we showed that the reducible cubics through those representatives are either triangles or conic+secant lines, showing that such reducible orbits are generic. This allowed us to obtain the formula of Theorem 6.2 for . Together, these results imply
Theorem 6.3 characterizes when this is an equality. When it is not, 6.12 implies the generic base locus is not reduced and so by 6.11 the inequality tightens to
which again by Theorem 6.3 is an equality. ∎
In Table 4 and Table 5, those Bézoutian quatroids satisfying any of the conditions in 6.11 are indicated by one additional symbol in their Reducibles column. This symbol, written in blue, indicates the type of the reducible cubic at which the intersection multiplicity of the discriminant and is (one) larger than its multiplicity, for a generic quatroid representative p. Hence, given a string of symbols of the form for , one may calculate the value in the column by , where is the indicator function of the presence of a third symbol.
6.3. The poset of Bézoutian quatroids
We conclude our work with some observations on the poset of Bézoutian quatroids given by the order . In order to display these results, instead of working with the Bézoutian quatroids, we work modulo the -symmetry, and use the orbits instead. This allows us to fully illustrate the induced poset in Figure 7, where if there exists in the orbit of such that .
We prove that the dimension of the realization space defines a grading on this poset of Bézoutian quatroids, in the sense of [31, Sec. 3.1]. Recall that covers when is minimally larger than . We have the following result.
Theorem 6.14.
The set with the order relation on quatroids is represented in Figure 7. It is partitioned into nine layers : if and only if . Moreover:
-
(i)
is the only quatroid in ,
-
(ii)
is the only quatroid in ,
-
(iii)
is graded by dimension: if covers then ,
-
(iv)
is graded by number of conditions: if covers then .
The proof of Theorem 6.14 relies on the following technical result, related to 3.3: on the subset of Bézoutian quatroids, the second condition listed in 3.3 completely characterizes the order relation.
Lemma 6.15.
Let be Bézoutian quatroids. The following are equivalent:
-
(i)
,
-
(ii)
,
-
(iii)
and , where is the set of all subsets of arising as the union of two elements of .
Proof.
The equivalence of (i) and (ii) is the definition of the order relation. The fact that (iii) implies (ii) follows from 3.3. It remains to show that (ii) implies (iii). If , every satisfies the linear and quadratic relations imposed by . This immediately implies . To conclude, let , and without loss of generality assume . Since is Bézoutian, there is a unique quadric through a generic . If this quadric is a conic, then . Otherwise it is the union of two lines: since is Bézoutian, no four points lie on a line. Hence, up to relabeling, showing and as desired. ∎
A technical consequence of 6.15 is that the closure step in step 6 of algorithm 1 does not alter the pair, whenever the quatroid that is being generated is Bézoutian. Implicitly, this fact yields the grading of by number of conditions, as one can see in the proof of Theorem 6.14.
Proof of Theorem 6.14.
We first prove statement (iv). Let be quatroids and suppose covers . By 6.15, and . We consider several cases:
-
•
Suppose there is a condition .
-
–
If for every we have then we claim and : this is immediate because satisfies Bézout’s criteria and is minimally larger than .
-
–
Otherwise, set and . Consider . By 6.15 . Moreover, there is exactly one more condition in than there is in . One may verify that is Bézoutian and so, as before, we conclude .
-
–
-
•
If , then because satisfies Bézout’s weak criteria. This implies , and by minimality for some .
This shows statement (iv). Statement (iii) is then a consequence of statement (iv) and the irreducibility of the strata . The structure of the poset in Figure 7 and statement (i) and (ii) follow by direct computation, which can be done in a purely combinatorial way using 6.15. ∎

7. Concluding Remarks
7.1. Positive certificates for non-rationality
Theorem 6.13 allows one to design non-rationality certificates for cubic curves through points in special position. More precisely, there are several quatroid strata satisfying : in these cases, for any , there are no rational cubics through . The same holds passing to the closure, proving the following result.
Theorem 7.1.
Let for some with
Then there are no rational cubics passing through .
We point out that if or , then is non-Bézoutian: in this case, there are no irreducible cubics at all passing through .
We remark that and are exhaustive Bézoutian quatroids so the matroid underlying the (reduced) base locus of any is well-defined; in these cases, this is the non-Fano matroid . Configurations of appear in [13], in the study of the topology of singular cubics. In a sense, configurations as in Theorem 7.1 are forbidden configurations on a rational cubic. More precisely, we have the following consequence.
Corollary 7.2.
Let be an irreducible cubic containing a configuration where
Then is not rational. These forbidden quatroids are illustrated in Figure 8.

To the extent of our knowledge, the existence of forbidden configurations guaranteeing non-rationality gives a novel way to prove non-rationality of a variety. In this sense, these are positive certificates of non-rationality. We leave open the problem of studying positive non-rationality certificates for curves of higher degree, and varieties of higher dimension.
7.2. A finer stratification
We remark that the values are the number of rational cubics through a generic configuration . A natural question is whether this is the number of rational cubics through every configuration . This is not the case, as observed in the following construction.
Consider the configuration , depending on a complex parameter and described by the matrix
For generic , the configuration represents quatroid : the points lie on the conic , and there is no other linear or quadratic relation. For generic , intersects in the reducible cubic with multiplicity , and additional rational cubics. Hence .
Let be the configuration for , which represents as well. In this case, the line is tangent to the conic . The pencil intersects at with intersection multiplicity and at an additional distinct rational cubics.
This construction shows that there are special configurations on the quatroid stratum satisfying . A similar example can be constructed on the other maximal non-uniform quatroid . A slightly different example can be constructed on : in this case, for a generic choice of , the only reducible cubic on is a triangle and intersects in with multiplicity and in rational cubics, so that . There is a locus in where the triangle degenerates to an asterisk: here and .
This phenomenon occurs on other strata. Interestingly, there are strata, such as , with the property that and with a locus of configurations such that . Understanding these loci, with no rational cubics through them, would provide other non-rationality certificates, in the sense of Section 7.1.
We expect the special loci described in this section always arise with either a conicline pair degenerating to a conictangent pair, or with a triangle degenerating to an asterisk. The second phenomenon is linear but it cannot be detected simply by the matroid underlying ; however, it is detected by the underlying discriminantal arrangement [1]. We plan to further investigate higher order versions of the discriminantal arrangement in future work.
7.3. Toward higher degree and higher genus
Given two integers and , one may consider the locus of plane curves of degree and genus . In [19], Harris answered a conjecture of Severi [29], proving that is irreducible of dimension . This inspired a body of work surrounding the natural enumerative problem:
Given points in , how many elements of interpolate them?
For generic points, this amounts to computing the degree of (the closure of) : when , the answer is Kontsevich’s formula [21] and a recursive formula was given for any genus in [10]. The present paper dealt with non-generic instances of the problem when , that is the case of rational cubics. Throughout our investigation, we enjoyed a number of nice properties:
-
•
the cubic discriminant is the union of rational cubics and reducible cubics,
-
•
the discriminant is cut out by a manageable polynomial,
-
•
the number of rational cubics through eight generic points is of modest size,
-
•
there is a known classification of orbit closures of rational and reducible cubics.
We propose the study of curves of higher degree and genus, with similar, higher order methods.
For instance, there are rational quartics through generic points. Despite all the “good” properties mentioned above failing in this setting, numerical methods can generate experimental data. We now consider the problem of computing all rational quartics through two interesting matroid strata on points. A Lüroth quartic is any quartic curve which goes through the intersection points of five lines. The set of Lüroth quartics forms an unwieldy hypersurface of degree in the space of homogeneous quartics [6, 25, 27]. These quartics inspire the definition of the Lüroth matroid on points, which we write in our quatroid format:
Numerical computations suggest that there are rational quartics through a Lüroth configuration. In Figure 9 we display one example of a Lüroth configuration and the real rational quartics which interpolate it.

A more restricted matroid is suggested by a regular pentagon configuration [33] which imposes five additional line conditions on the eleventh point. The underlying matroid is
Such a configuration can be realized over but not , and it is unique up to the action of . We invite the reader to draw this configuration. A numerical calculation suggests that there are rational quartics interpolating the regular pentagon configuration, none of which are real.
Appendix
Name | Description | Relevant Results |
---|---|---|
Quatroids.jl | The julia package Quatroids.jl. All commands loaded by this package are indicated by blue font | |
SimpleMatroids38.txt | File extracted from the database https://www-imai.is.s.u-tokyo.ac.jp/~ymatsu/matroid/ listing all simple rank matroids on eight elements | |
GenerateAllMatroids() | Parses the file SimpleMatroids38.txt to obtain an exhaustive list of simple -representable matroids of rank at most three on eight elements | Theorem 3.19 |
AllConicExtensions(M) | Runs algorithm 1 on a matroid represented by nonbases of size three | Theorem 3.19 |
GenerateAllCandidateQuatroids() | Runs algorithm 1 all -representable matroids of rank at most three on eight elements | Theorem 3.19 Table 4 Table 5 |
OrbitSizes() | Computes the sizes of each orbit of candidate quatroids | Theorem 3.19 3.21 Table 4 Table 5 |
Bezoutian() | Returns a boolean vector of length whose -th entry indicates whether is Bézoutian | 3.15 Table 4 Table 5 |
RationalRepresentatives.txt | A file, given in julia (.txt) and Macaulay2 (.m2) format, whose -th line is a matrix of integers whose columns represent | Theorem 3.20 |
TestingRepresentatives.m2 | A Macaulay2 script which confirms that each representative in RationalRepresentatives.txt represents the quatroid claimed | Theorem 3.20 |
ReducedBaseLocus(Q) | Indicates if the quatroid has reduced base locus due to 3.25 | 3.26 |
QuatroidReductions() | Iteratively reduces each quatroid based on the four conditions described in Section 4 | 4.5 |
Modifications(Q) | Computes all such that | 4.6 |
IrreducibilityQ21.m2 etc | A Macaulay2 script which establishes the irreducibility of as described in the proof of Theorem 4.7. Similar files exist for and | Theorem 4.7 |
cubicInvs.m2 | A Macaulay2 file containing the cubic discriminant | algorithm 2 |
countReducibleCubics.m2 | Applies algorithm 2 to each of the rational representatives of Bézoutian quatroids in RationalRepresentatives.m2 | Theorem 5.5 Table 4 Table 5 |
QuatroidsWeakUpperBounds() | Evaluates the formula for from Theorem 6.2 for each Bézoutain quatroid | Theorem 6.3 |
ContainedIn10(Q) ContainedIn77(Q) | Checks and respectively | Theorem 6.3 |
tangentConesPlaneCubics.m2 | Computes the tangent cones of each singular cubic | 6.7 Table 1 Table 2 |
Num | Orb | Lines | Conics | Reducibles | |
---|---|---|---|---|---|
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NR | NR |
Num | Orb | Lines | Conics | Reducibles | |
---|---|---|---|---|---|
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB | |||||
NB |


References
- ABF+ [23] D. Agostini, T. Brysiewicz, C. Fevola, L. Kühne, B. Sturmfels, S. Telen, and T. Lam. Likelihood degenerations. Advances in Mathematics, 414:108863, 2023. doi:10.1016/j.aim.2023.108863.
- AD [09] M. Artebani and I. V. Dolgachev. The Hesse pencil of plane cubic curves. L’Enseignement Mathématique, 55(3):235–273, 2009. doi:10.4171/LEM/55-3-3.
- BBC+ [23] D. Bates, P. Breiding, T. Chen, J. Hauenstein, A. Leykin, and F. Sottile. Numerical nonlinear algebra. arXiv:2302.08585, 2023.
- BEKS [17] J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah. Julia: a fresh approach to numerical computing. SIAM Rev., 59(1):65–98, 2017. doi:10.1137/141000671.
- BGM [94] A. Bigatti, A. V. Geramita, and J. C. Migliore. Geometric consequences of extremal behavior in a theorem of Macaulay. Trans. Amer. Math. Soc., 346(1):203–235, 1994. doi:10.1090/S0002-9947-1994-1272673-7.
- Bry [20] T. Brysiewicz. Numerical Software to Compute Newton polytopes and Tropical Membership. Mathematics in Computer Science, 14(3):577–589, 2020. doi:10.1007/s11786-020-00454-4.
- BT [18] P. Breiding and S. Timme. HomotopyContinuation.jl: A package for homotopy continuation in Julia. In Mathematical Software–ICMS 2018: 6th International Conference, South Bend, IN, USA, July 24-27, 2018, Proceedings 6, page 458–465. Springer, 2018. doi:10.1007/978-3-319-96418-8_54.
- CG [23] L. Chiantini and F. Gesmundo. Decompositions and Terracini loci of cubic forms of low rank. arXiv:2302.03715, 2023. to appear in Deformation of Artinian Algebras and Jordan Types, CONM.
- CGMM [22] O. Clarke, K. Grace, F. Mohammadi, and H. J. Motwani. Matroid stratifications of hypergraph varieties, their realization spaces, and discrete conditional independence models. arXiv:2103.16550, 2022. doi:10.1093/imrn/rnac268.
- CH [98] L. Caporaso and J. Harris. Counting plane curves of any genus. Inventiones Mathematicae, 131(2):345–392, 1998. doi:10.1007/s002220050208.
- Cox [50] H. S. M. Coxeter. Self-dual configurations and regular graphs. Bull. Amer. Math. Soc., 56:413–455, 1950. doi:10.1090/S0002-9904-1950-09407-5.
- Dol [12] I. V. Dolgachev. Classical algebraic geometry: A modern view. Cambridge University Press, Cambridge, 2012. doi:10.1017/CBO9781139084437.
- Fie [10] S. Fiedler-Le Touzé. Pencils of cubics with eight base points lying in convex position in . arXiv:1012.2679, 2010.
- Ful [69] W. Fulton. Algebraic Curves. Math. Lecture Series. Benjaming Cummings, 1969.
- GH [94] P. A. Griffiths and J. Harris. Principles of algebraic geometry. Wiley Classics Library. John Wiley & Sons Inc., New York, 1994. Reprint of the 1978 original.
- GKZ [94] I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky. Discriminants, resultants, and multidimensional determinants. Mathematics: Theory & Applications. Birkhäuser, Boston, MA, 1994.
- Gro [22] The GAP Group. Gap – groups, algorithms, and programming, version 4.12.2, 2022. URL: https://www.gap-system.org.
- [18] Daniel R. Grayson and Michael E. Stillman. Macaulay2, a software system for research in algebraic geometry. Available at http://www2.macaulay2.com.
- Har [86] J. Harris. On the Severi problem. Inventiones mathematicae, 84(3):445–461, 1986. doi:10.1007/BF01388741.
- Ing [71] A. W. Ingleton. Representation of Matroids. In Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), page 149–167. Academic Press, London-New York, 1971.
- KM [94] M. Kontsevich and Y. Manin. Gromov-Witten classes, quantum cohomology, and enumerative geometry. Comm. Math. Physics, 164:525–562, 1994. doi:10.1007/BF02101490.
- KM [02] I. A. Kogan and M. M. Maza. Computation of canonical forms for ternary cubics. In ISSAC ’02: Proceedings of the 2002 international symposium on Symbolic and algebraic computation, page 151–160, New York, NY, USA, 2002. ACM. doi:10.1145/780506.780526.
- MMIB [12] Y. Matsumoto, S. Moriyama, H. Imai, and D. Bremner. Database of matroids, 2012. URL: https://www-imai.is.s.u-tokyo.ac.jp/~ymatsu/matroid/.
- MST [03] G. Megyesi, F. Sottile, and T. Theobald. Common transversals and tangents to two lines and two quadrics in p. Discrete & Computational Geometry, 30(4):543–571, 2003. doi:10.1007/s00454-003-0789-4.
- OS [10] G. Ottaviani and E. Sernesi. On the hypersurface of Lüroth quartics. Michigan Math. J., 59(2):365–394, 2010. doi:10.1307/mmj/1281531462.
- Osc [23] Oscar. -open source computer algebra research system, version 0.12.2-dev, 2023.
- Ott [13] G. Ottaviani. A computational approach to Lüroth quartics. Rendiconti del Circolo Matematico di Palermo, 62:165–177, 2013. doi:10.1007/s12215-013-0114-x.
- Oxl [06] J. G. Oxley. Matroid Theory (Oxford Graduate Texts in Mathematics). Oxford University Press, Inc., USA, 2006.
- Sev [21] F. Severi. Vorlesungen über Algebraische Geometrie: Geometrie auf einer Kurve Riemannsche Flächen Abelsche Integrale. Springer, 1921.
- Sha [94] I. R. Shafarevich. Basic algebraic geometry. 1 - Varieties in projective space. Springer-Verlag, Berlin, second edition, 1994.
- Sta [12] R. P. Stanley. Enumerative combinatorics. Vol. 1, volume 49 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2012.
- Zie [91] G. M. Ziegler. Some minimal non-orientable matroids of rank three. Geometriae Dedicata, 38(3):365–371, 1991. doi:10.1007/BF00181199.
- Zie [08] G. M. Ziegler. Nonrational configurations, polytopes, and surfaces. The Mathematical Intelligencer, 30(3):36–42, 2008. doi:10.1007/BF02985377.