The excluded minors for -representable matroids on ten elements
Abstract.
Mayhew and Royle (2008) showed that there are excluded minors for the class of -representable matroids having at most elements. We enumerate the excluded minors for -representable matroids having elements: there are precisely 2128 such excluded minors. In the process we find, for each , the excluded minors for the class of -representable matroids having at most elements, and the excluded minors for the class of -representable matroids having at most elements.
1. Introduction
The excluded-minor characterisations for binary, ternary, and quaternary matroids are seminal results in matroid theory: there are 1, 4, and 7 excluded minors for these classes, respectively [25, 24, 3, 14]. For the class of matroids representable over , the excluded-minor characterisation is not known. However, in 2008 Mayhew and Royle enumerated all matroids on at most nine elements, and thereby found that there are precisely 564 excluded minors on at most nine elements [16].
These days, one can easily enumerate all 383172 matroids on at most nine elements on their home computer should they wish111For example, see the MatroidUnion blog post here: http://matroidunion.org/?p=301., but enumerating all -element matroids still appears well out of reach (Mayhew and Royle estimate there are at least sparse paving matroids with rank 5 and elements [16]). However, here we enumerate all those that are excluded minors for the class of -representable matroids.
Theorem 1.1.
There are excluded minors for -representability on elements.
Our approach to find these excluded minors uses the theory of Hydra- partial fields developed by Pendavingh and van Zwam [21]. A -connected matroid representable over has at most six inequivalent representations [20]. Let be a -connected matroid with a - or -minor. Pendavingh and van Zwam showed that, for each , there is a partial field such that is -representable if and only if has at least inequivalent representations over . In particular, . Moreover, ; that is, if has at least five inequivalent representations over , then it has precisely six. For , let be the set of excluded minors for the class of -representable matroids that are -representable. Then, the matroids in are strong stabilizers for the class of -representable matroids [26]; loosely speaking, this means that when considering a -connected matroid in this class with some matroid in as a minor, then a representation of uniquely extends to a representation of . Thus, using this theory, one can first find the excluded minors for -representability on at most elements, then let be those that are -representable, and then use these as seeds in order to find the excluded minors for -representability on at most elements. This process can then be repeated to find the excluded minors for -representability on at most elements. After two further iterations, one obtains the excluded minors for -representability on at most elements, and these are the excluded minors for the class of -representable matroids, just under another name.
As a slightly more subtle point, note that when an excluded minor for the class of -representable matroids is -representable, for some , it need not be -representable. For example, is an excluded minor for -representable matroids that is -representable, but not - or -representable. In this case, where is -representable, for some , but is not -representable, is an excluded minor for the class of -representable matroids for each , and, in particular, it is a member of , so will be used as a seed to find excluded minors for the class of -representable matroids.
The resolution of Rota’s conjecture [12] guarantees that there is a finite number of excluded minors for the class of -representable matroids. There are certainly excluded minors for this class on more than 10 elements; in particular, there is an excluded minor on 12 elements, on 14 elements, and on 16 elements [8]. It is natural to ask the value of finding an incomplete list of excluded minors. For the excluded-minor characterisations of representable matroids that are currently known exactly, the excluded minors have at most 8 elements [14, 15, 7], and there are at most 17 of them in total [7], so there is little that can be gleaned regarding how one might expect the excluded minors of increasing sizes to be distributed. However, in light of Theorem 1.1, it seems likely that so far we have only discovered the tip of the iceberg (whereas one could have been a little bit more optimistic if only aware of those on at most 9 elements). With effort, or more computing power, one might be able to extend the search beyond 10 elements, but reaching (or exceeding) 16 elements appears a long way off. Nonetheless, in the author’s opinion, it is worthwhile to explore how bad things might be, and there is precedent for doing this for minor-closed classes of graphs having similarly unwieldy excluded-minor characterisations [28, 17].
More concretely, a component of this work, when combined with [7], gets us tantalisingly close to a complete list of the excluded-minors for the class of -representable matroids. It turns out that the class of -representable matroids is closely related to another well-studied class. For an integer , the class of -regular matroids is an algebraic generalisation of the class of regular and near-regular matroids, where regular matroids correspond to -regular matroids, and near-regular matroids correspond to -regular matroids (a formal definition of these classes is given in Section 2). Although the class of near-regular matroids coincides with the class of matroids representable over all fields of size at least three [27], the class of -regular matroids is a proper subclass of matroids representable over all fields of size at least four [23]. However, the class of -regular matroids coincides with the class of -representable matroids [7]. Thus, attempts to discover the excluded minors for -representable matroids can equivalently be viewed as attempts to discover the excluded minors for -regular matroids.
Brettell, Oxley, Semple, and Whittle showed that an excluded minor for the class of -regular matroids, or for the class of -regular matroids, has at most elements [7]. Brettell and Pendavingh computed the excluded minors for the class of -regular matroids of size at most [8]. Thus, an excluded-minor characterisation for the class of -regular matroids is now known, and this is an important step towards understanding matroids representable over all fields of size at least four.
To find the excluded minors for -representability of size at most , using the approach described earlier, the first step is to find the excluded minors for the class of -representable matroids of size at most . However, to complement the aforementioned known bound on an excluded minor for the class of -representable matroids, we extend our search beyond matroids of size . We do not quite match the bound of , however; we find all excluded minors for the class having at most elements.
Theorem 1.2.
There are exactly matroids that are excluded minors for the class of -representable matroids and have at most elements.
Descriptions of these matroids appear in Section 4 (see Theorem 4.5).
For Theorem 1.1, we borrow from the approach taken in [8]; however, to find the excluded minors for -representability of size at most , the computational techniques we require are less advanced, since we are only dealing with matroids of size at most . On the other hand, as we are dealing with much larger sets of excluded minors and stabilizers, careful book-keeping is required. For Theorem 1.2, the more advanced techniques employed in [8] become useful; in particular, when considering matroids of size , we can dramatically speed up the computations by only considering compatible pairs of extensions of matroids of size (rather than all extensions of matroids of size ). For this approach to be exhaustive while only keeping track of -connected matroids with a certain -minor, we require a splitter theorem for -detachable pairs [9]. Moreover, there are particular -element matroids for which we cannot guarantee the existence of -detachable pairs; we study these further, to show they are not excluded minors for the class of -representable matroids.
One final observation from this work is that an excluded-minor characterisation for -representable matroids, though extremely difficult, could perhaps also be achievable, putting it in a similar category to dyadic matroids and matroids representable over all fields of size at least four.
This paper is structured as follows. In the next section, we review partial fields, stabilizers, and other related notions that we need to describe the methodology, and argue the correctness, of our approach. In the two subsequent sections, we consider the innermost layer of the Hydra hierarchy, -representable matroids. First, we study -element matroids that have no -detachable pairs, in Section 3. Then, in Section 4, we obtain the excluded minors for the class of -representable matroids on at most elements. In Section 5, we consider the excluded minors for the remaining layers of the Hydra hierarchy: that is, the class of -representable matroids for . We finish with some final remarks in Section 6, including the observation that each Hydra partial field is universal.
Our notation and terminology follows Oxley [18], unless specified otherwise. We note that some of the results of this paper have also appeared, informally, on the MatroidUnion blog222See http://matroidunion.org/?p=3815..
2. Preliminaries
For a matroid and a set of matroids , we say that has an -minor if has a minor isomorphic to for some .
Partial fields
A partial field is a pair , where is a commutative ring with unity, and is a subgroup of the group of units of such that . Note that is a partial field for any field .
For disjoint sets and , we refer to a matrix with rows labelled by elements of and columns labelled by elements of as an matrix. Let be a partial field, and let be an matrix with entries from . Then is a -matrix if every square submatrix of with a non-zero determinant is in . If and , then we write to denote the submatrix of with rows labelled by and columns labelled by . We also say that is an element of , and write , if or .
Lemma 2.1 ([21, Theorem 2.8]).
Let be a partial field, and let be an -matrix, where and are disjoint sets. Let
Then is the family of bases of a matroid on ground set .
For an -matrix , we let denote the matroid in Lemma 2.1, and say that is a -representation of . Note that this is sometimes known as a reduced -representation in the literature; here, all representations will be “reduced”, so we simply refer to them as representations. A matroid is -representable if there exists some -matrix such that .
For partial fields and , a function is a homomorphism if
-
(i)
,
-
(ii)
for all , and
-
(iii)
for all such that .
The existence of a homomorphism from to certifies that any -representable matroid is also -representable:
Lemma 2.2 ([21, Corollary 2.9]).
Let and be partial fields and let be a homomorphism. If a matroid is -representable, then it is also -representable. In particular, if is a -representation of a matroid , then is a -representation of .
Representability over a partial field can be used to characterise representability over each field in a set of fields. Indeed, for any finite set of fields , there exists a partial field such that a matroid is -representable if and only if it is -representable [22, Corollary 2.20].
Let be a matroid. Pendavingh and van Zwam described [21, Section 4.2] a canonical construction of a partial field with the property that for every partial field , the matroid is -representable if and only if there exists a homomorphism (see also [2]). We call the partial field the universal partial field of .
Stabilizers
Let be a partial field, and let and be -matrices. We say that and are scaling equivalent if can be obtained from by scaling rows and columns by elements of . If can be obtained from by scaling, pivoting, and permuting rows and permuting columns (permuting labels at the same time), then we say that and are projectively equivalent. If can be obtained from by scaling, pivoting, permuting rows and permuting columns, and also applying automorphisms of , then we say that and are algebraically equivalent.
We say that a matroid is uniquely -representable if any two -representations of are algebraically equivalent. On the other hand, two -representations of are inequivalent if they are not algebraically equivalent.
Let and be -representable matroids, where has an -minor. Then stabilizes over if for any scaling-equivalent -representations and of that extend to -representations and of , respectively, and are scaling equivalent.
For a partial field , let be the class of matroids representable over . A matroid is a -stabilizer if, for any -connected matroid having an -minor, the matroid stabilizes over . Following Geelen et al. [13], we say that a matroid is a strong -stabilizer if, for any -connected matroid having an -minor, the matroid stabilizes over , and every -representation of extends to a -representation of .
The Hydra- partial fields
The Hydra- partial field is:
where are indeterminates.
The Hydra- partial field is:
where are indeterminates.
The Hydra- partial field is:
where is an indeterminate.
The Hydra- partial field is:
where is a root of .
We also let , and .
For each , there is a homomorphism . For example, let be determined by , , and ; let be determined by and ; let be determined by ; and let be determined by .
Lemma 2.3 ([21, Theorem 5.7]).
Let be a -representable matroid that is -connected and has a -minor, and let . The matroid is -representable if and only if has at least inequivalent representations over .
For -representable matroids that are -connected with a -minor, the two inequivalent -representations can be obtained by substituting . For -representable matroids, three inequivalent -representations can be obtained by substituting . For -representable matroids, four inequivalent -representations can be obtained by substituting
For -representable matroids, six inequivalent -representations can be obtained by substituting
Corollary 2.4 (see [21, Lemma 5.17]).
Let be a -representable matroid that is -connected and has a -minor. The matroid is -representable if and only if has six inequivalent representations over .
A matroid is dyadic if it is representable over and . Equivalently, a matroid is dyadic if it is -representable, where is the partial field
There is a homomorphism from to every field with characteristic not two. There is also a homomorphism from to . Note that, although a dyadic matroid is -representable, it has no -minor, so Lemma 2.3 does not apply.
The -regular partial fields
For a non-negative integer , the -regular partial field is:
where are indeterminates. A matroid is -regular if it is representable over the -regular partial field.
Note that is the universal partial field of [26, Theorem 3.3.24]. It is easy to see that, for any non-negative integer , there is a homomorphism from to .
In particular, the -regular (or just regular) partial field is
the -regular (or near-regular) partial field is
where is an indeterminate; the -regular partial field is
where are indeterminates; and the -regular partial field is
where are indeterminates.
Van Zwam [26] observed that there is a homomorphism from to . It turns out that there is a homomorphism where is a bijection [7].
Lemma 2.5 ([7, Lemma 2.25]).
The partial fields and are isomorphic. In particular, a matroid is -regular if and only if it is -representable.
The next corollary then follows from Lemmas 2.3, 2.5 and 2.4.
Corollary 2.6.
Let be a -connected matroid with a -minor. The following are equivalent:
-
(i)
is -regular.
-
(ii)
has at least five inequivalent -representations.
-
(iii)
has precisely six inequivalent -representations.
Alternatively, a matroid is -regular if and only if it is either near-regular or has six inequivalent -representations.
Lemma 2.7 ([26, Lemmas 6.2.5 and 7.3.15]).
For , let be an excluded minor for the class of -representable matroids, such that is -representable. Then is a strong -stabilizer.
Other partial fields
Although not of central importance, we also refer to the following partial fields:
where is an indeterminate, and
where is a root of . See [26] for further details.
Delta-wye exchange
Let be a matroid with a triangle . Consider a copy of having as a triangle with as the complementary triad labelled such that , and are triangles. Let denote the generalised parallel connection of with this copy of along the triangle . Let be the matroid where the elements , and are relabelled as , and respectively. The matroid is said to be obtained from by a - exchange on the triangle , and is denoted . Dually, is obtained from by a - exchange on the triad if is obtained from by a - exchange on . The matroid is denoted .
We say that a matroid is -equivalent to a matroid if can be obtained from by a sequence of - and - exchanges on coindependent triangles and independent triads, respectively. We let denote the set of matroids that are -equivalent to . For a set of matroids , we use to denote . We also use to denote , and use to denote .
Oxley, Semple, and Vertigan proved that the set of excluded minors for -representability is closed under - exchange (see also [1]), and, more generally, segment-cosegment exchange.
Proposition 2.8 ([19, Theorem 1.1]).
Let be a partial field, and let be an excluded minor for the class of -representable matroids. If , then is an excluded minor for the class of -representable matroids.
Proxies
Following [8], in order to simulate a matroid representation over a partial field, we use a representation over a finite field where we have constraints on the subdeterminants appearing in the representation. We briefly recap this theory (for a more detailed account, see [8, Section 3]).
Let be a partial field. We say that is fundamental if . We denote the set of fundamentals of by . Let be a -matrix. For a -matrix , we write if is a submatrix of a -matrix that is projectively equivalent to . The cross ratios of are
Let . We say that the -matrix is -confined if . If is an -confined -matrix and is a homomorphism, then and
so that is an -confined representation over .
For a finite field and homomorphism , let . We say that is a proxy for if for any -confined -matrix , there exists a -matrix such that is scaling-equivalent to . The following is a consequence of [8, Theorem 3.5].
Lemma 2.9.
Let . There exists a prime and a homomorphism such that is a proxy for .
In particular, when is a proxy for , a matroid is -representable if and only if has an -confined -representation. In Table 1, we provide the proxies for each Hydra- partial field that we used in our computations.
Splitter theorems
For our computations, we keep track only of -connected matroids with an -minor (where the matroids in are strong stabilizers). Thus, we require the following consequence of Seymour’s Splitter Theorem (see, for example, [18, Corollary 12.2.2]).
Lemma 2.10 ([8, Corollary 2.8]).
Let be a -connected matroid with a proper -minor, where is not near-regular. Then, for some , there exists an element such that is -connected and has an -minor.
Hall, Mayhew, and van Zwam [15] proved an excluded-minor characterisation for near-regular matroids. Two of the excluded minors for this class are and . In this paper, we deal primarily with -connected matroids that have a -minor, so Lemma 2.10 applies.
To find the excluded minors for -representability on up to elements, we use the technique referred to as “splicing” in [8, Section 4.5]. Briefly, when is a matroid, is an extension of by an element , and is an extension of by an element , then the extensions and are compatible if there exists a matroid on such that and . (A characterisation of compatible extensions was given by Cheung [11].) In this case, following [8], we say that is a splice of and . (We note that a “splice” has a different meaning in [4].) For a positive integer , an -element matroid can be constructed as the splice of two -element matroids, and say, where and are both single-element extensions of some -element matroid .
Starting from some set of “seed matroids”, we build a catalog of the -connected matroids in the class that have an -minor for some . Suppose is a matroid that should appear in the catalog, where has an -minor for . In order to ensure that is obtained as the splice of two matroids and , we require a guarantee that, for some pair , the matroid is also in the catalog. In fact, by closing the catalog under duality, it suffices that one of and appears in the catalog. Thus, we require a pair , such that either or is -connected and has an -minor; such a pair is known as an -detachable pair [9].
To describe the conditions under which has no -detachable pairs, we require some definitions.
Definition 2.11.
Let be an exactly -separating set in a matroid , with . Suppose has the following properties:
-
(a)
there is a partition of into pairs such that for all distinct , the set is a cocircuit,
-
(b)
there is a partition of into pairs such that for all distinct , the set is a circuit,
-
(c)
and are -connected for each ,
-
(d)
for all distinct , the matroid is -connected for any and , and
-
(e)
for all distinct , the matroid is -connected for any and .
Then we say is a spiky -separator of .
Definition 2.12.
A matroid is a quad-flower if , and there is a labelling of such that, for all ,
-
(i)
is a circuit and a cocircuit,
-
(ii)
the sets , , , and are circuits, and
-
(iii)
the sets , , , and are cocircuits.
We call the quad-flower labelling of , and say that has standard labelling if and the quad-flower labelling is obtained by applying the identity map.
An example of a quad-flower is given in Figure 1.
Definition 2.13.
A matroid is a nest if , and there is a labelling of such that
-
(i)
the following sets are circuits:
-
(ii)
and the following sets are cocircuits:
We call the nest labelling of , and say that has standard labelling if and the nest labelling is obtained by applying the identity map.
Note that a “nest” is referred to as a “nest of twisted cubes” in [9].
Theorem 2.14 ([9, Corollary 6.3]).
Let be a -connected matroid and let be a -connected minor of with , , and . Then either
-
(i)
has an -detachable pair;
-
(ii)
there is a matroid obtained by performing a single - or - exchange on such that has an -minor and an -detachable pair, or
-
(iii)
has a spiky -separator such that at most one element of is not in , or
-
(iv)
, and is either a quad-flower or a nest.
The next lemma is used to handle the possibility that Theorem 2.14(iii) holds. It is a slight generalisation of [6, Lemma 7.2], but can be proved using essentially the same argument as given there.
Lemma 2.15 (see [6, Lemma 7.2]).
Let be a partial field, let be a non-binary -connected strong stabilizer for the class of -representable matroids, and let be an excluded minor for the class of -representable matroids, where has an -minor. If has a spiky -separator such that at most one element of is not in , then .
To handle the possibility that Theorem 2.14(iv) holds, we need to consider what (partial) fields a quad-flower, or a nest, is representable over. This analysis is done in the next section.
3. Exceptional -element matroids
When is a quad-flower or a nest, and is a -connected minor of , we cannot guarantee that has an -detachable pair. When enumerating potential excluded minors using splicing, these matroids will be skipped. Thus, we need to be able to verify that these matroids are not excluded minors for the class of -representable matroids. It suffices to verify that each of these matroids contains either the Fano matroid , the non-Fano matroid , or the relaxation of the non-Fano matroid , as a proper minor (due to the upcoming Lemma 4.2). However, so that these techniques can also be applied more generally (for partial fields other than ), we briefly study quad-flowers and nests. We will show that there are, up to isomorphism, three quad-flowers that are representable over some field (one is binary, one is dyadic, and one is representable over all fields of size at least four), whereas any other quad-flower has a proper minor that is not representable over any field. Up to isomorphism, there are three nests: one is binary, one is dyadic, while the other is not representable over any field.
Quad-flowers
First, we consider the circuits in a quad-flower. We will see that the only sets that can be non-spanning circuits are the -element circuits listed in the definition, and certain -element sets. Among these -element sets, there are some that are circuits in every quad-flower, and some that can be either a circuit or a basis. We introduce notation to refer to the latter sets. Recall that a quad-flower with standard labelling is on the ground set . For , let be the -element set such that for each , and for each .
Lemma 3.1.
Let be a quad-flower with standard labelling. Then all of the following hold:
-
(i)
If is a non-spanning circuit of , then .
-
(ii)
If is a circuit of with , then is one of the circuits listed in Definition 2.12(i)–(ii).
-
(iii)
For any and , , and , the set is a -element circuit of .
-
(iv)
If is a circuit of with but is not a circuit described in (iii), then for some .
Proof.
By orthogonality and the fact that no circuit is properly contained in another, a quad-flower has no circuits of size at most five other than the circuits of size four listed in the definition. Since , this proves (i) and (ii). Moreover, by circuit elimination and orthogonality, it follows that (iii) holds. For (iv), let with such that does not contain one of the circuits of size four, and is not a circuit as described in (iii). It follows that for some . ∎
Although we focus on the circuits in a quad-flower, a similar statement to Lemma 3.1 can be made regarding the cocircuits. It then follows easily that a quad-flower is -connected.
We distinguish three particular quad-flowers; we will show that (up to isomorphism) these are the only three quad-flowers that are representable over some field. We say that
-
•
is a binary quad-flower if has a quad-flower labelling such that is a circuit for all ;
-
•
is a dyadic quad-flower if has a quad-flower labelling such that, for , the set is a circuit if and only if ; and
-
•
is a free quad-flower if has a quad-flower labelling such that is a basis for all .
The next lemma illustrates the reasoning behind the first two of these names.
Lemma 3.2.
Let be a quad-flower. Then precisely one of the following holds:
-
(i)
is a binary quad-flower, and is -representable if and only if has characteristic two,
-
(ii)
is a dyadic quad-flower, and is -representable if and only if has characteristic not two,
-
(iii)
is a free quad-flower, and is -representable if and only if , or
-
(iv)
has a proper minor such that is not representable over any field.
Proof.
We let be a quad-flower with standard labelling, so Lemma 3.1 holds. Consider for some . There are possibilities for the set , and each of these could be either a circuit or a basis in a quad-flower . It is convenient to think of each as a vertex in a graph: consider the -dimensional hypercube graph on vertex set , where distinct vertices and are adjacent if and only if the cardinality of the set difference is one. Let be a subset of the vertices of , where if is a circuit of , whereas if is a basis of . Then, for the quad-flower , we obtain an auxiliary set .
Suppose that for some and that are adjacent in (so ). Let such that . Then it follows that has an -restriction (where is the Fano matroid), so is not representable over any field that does not have characteristic two. On the other hand, if precisely one of and is in , then it follows that has an -restriction (where is the non-Fano matroid), so is not representable over fields with characteristic two.
We first assume that is not a binary quad-flower, a dyadic quad-flower, nor a free quad-flower, and show that (iv) holds. In particular, since is not a binary quad-flower nor a free quad-flower, . We claim that if is not a stable set in , then has a proper minor that is not representable over any field. Since , there exist adjacent vertices of , precisely one of which is in . Suppose is not a stable set in , so there exist adjacent vertices of in . Then there exist distinct such that and , where is adjacent to both and in . It now follows, by the previous paragraph, that has a proper minor that is not representable over any field, as claimed.
Now we assume that is a stable set in . We note that is one of four quad-flowers, up to isomorphism (recalling that is not a dyadic or free quad-flower). For any , the set or the set induces a -cycle in , so at most two of the four sets in or are circuits. Since is not a binary quad-flower, a dyadic quad-flower, nor a free quad-flower, there exists some such that either or . Up to isomorphism, we may assume that is a circuit in , but the sets , , and are bases. Consider . We claim that is not representable over any field. If has an -representation for some field , then it is easy to verify (see [18, Theorem 6.4.7], for example) that is projectively equivalent to a matrix of the form
where signifies the entry is non-zero.
By considering the dependent sets , , , and , we see that the matrix is in fact of the form
for some . However, since is a circuit in , but since is a basis in . So is not representable over any field.
We have shown that if is not a binary quad-flower, a dyadic quad-flower, nor a free quad-flower, then (iv) holds. Suppose now that is a quad-flower that is representable over some partial field . Let be a -representation for . Then it is easy to verify that is projectively equivalent to the matrix
where .
When is a binary quad-flower, we obtain a -representation (for any positive integer ) by setting , so is representable over any field with characteristic two. Since a binary quad-flower has an -minor, it is not representable over any other field, so (i) holds.
When is a dyadic quad-flower, we obtain a -representation by setting (where ). In particular, this is an -representation for any field having characteristic not two. Since a dyadic quad-flower has an -minor, (ii) holds.
When is a free quad-flower, then has an -minor, where is the matroid obtained from by relaxing a circuit-hyperplane. Thus is not -regular. In particular, as has a -minor, is not binary or ternary. However, is -representable whenever , as then the above matrix is an -representation after choosing . (Alternatively, the above matrix is a -representation, and there is a homomorphism from to any field with size at least four [26, Lemma 2.5.33].) This shows that (iii) holds. ∎
Nests
Next, we consider nests. We start by considering the circuits. We omit the proof of the next lemma; it follows from orthogonality, the circuit axioms, and the fact that , similar to Lemma 3.1.
Lemma 3.3.
Let be a nest with standard labelling. Then all of the following hold:
-
(i)
If is a non-spanning circuit of , then .
-
(ii)
If is a circuit of with , then is one of the circuits listed in Definition 2.13(i).
-
(iii)
If is a circuit of , then and are -element circuits of .
-
(iv)
If is a circuit of with but is not a circuit described in (iii), then .
By Lemma 3.3, there are three non-isomorphic nests, depending on whether both, none, or one of the sets described in (iv) are circuits. We say that a nest is
-
•
tight if it has a nest labelling such that both and are circuits;
-
•
loose if it has a nest labelling such that both and are bases; and
-
•
slack if it has a nest labelling such that one of and is a circuit, and the other is a basis.
Lemma 3.4.
Let be a nest. Then has a -minor. Moreover,
-
(i)
when is tight, is -representable if and only if has characteristic two;
-
(ii)
when is loose, is -representable if and only if has characteristic not two; and
-
(iii)
if is slack, then is not representable over any field.
Proof.
Assume that has standard labelling, and consider the minor . By Definition 2.13(i) and Lemma 3.3(iii), has circuits , , , , , and . Moreover, is either a circuit or a basis in . It follows that has an -minor. Suppose that is tight or loose. If is tight, then has an -minor, so is not representable over any field that does not have characteristic two; and if is loose, then has an -minor, so is not representable over any field that has characteristic two. Let be the matrix
over a field . When has characteristic two, is an -representation of a tight nest; otherwise, is an -representation of a loose nest. This proves (i) and (ii).
It remains to prove (iii). Suppose is slack, and consider the minor . By Definition 2.13(i) and Lemma 3.3(iii), has circuits , , , , , and . Either is a circuit in and is a basis in , or is a basis in and is a circuit in . It follows that has both an - and -minor, so is not representable over any field. ∎
4. Excluded minors for -regular matroids
In this section, we consider excluded minors for the class of -representable matroids. Recall that this is, equivalently, the class of -regular matroids. The following theorem is the recently obtained excluded-minor characterisation of -regular matroids [7, 8]. The matroids appearing in this theorem are well known (as they appear in the excluded-minor characterisation for either -representable matroids [14] or near-regular matroids [15]), with two exceptions. The matroid is obtained from by relaxing one of the two disjoint circuit-hyperplanes. The matroid is a rank- sparse paving matroid on ground set with eight non-spanning circuits , working modulo 8.
Theorem 4.1 ([7, Theorem 1.2]).
A matroid is -regular if and only if has no minor isomorphic to , , , , , , , , , , , , , , , , and .
The next lemma follows from Theorem 4.1, by considering which of the excluded minors for -regular matroids are -regular (see [8, Table 5]).
Lemma 4.2.
Let be an excluded minor for the class of -regular matroids. Then, either
-
(i)
has a -minor, or
-
(ii)
is isomorphic to a matroid in
The following is a consequence of the fact that is a strong -stabilizer [26, Lemma 7.3.16].
Lemma 4.3.
The matroids , , , and are strong -stabilizers.
We also require the following consequence of Lemmas 3.2, 3.4 and 4.2.
Lemma 4.4.
If is a quad-flower or a nest, then is not an excluded minor for the class of -regular matroids.
Proof.
If is a nest, then has either or as a proper minor, by Lemma 3.4, so is not an excluded minor for the class of -regular matroids, by Lemma 4.2. Suppose that is a quad-flower that is an excluded minor for the class of -regular matroids. Then every proper minor of is -regular. By Lemma 3.2, is either a binary quad-flower, a dyadic quad-flower, or a free quad-flower. But then has either , , or as a proper minor, respectively, contradicting Lemma 4.2. ∎
For a matroid , let denote the matroid obtained from by a free single-element extension. Consider the set of matroids that can be obtained from the Fano matroid by relaxing circuit-hyperplanes. This gives the sequence
geometric representations of these matroids are given in Figure 2. These matroids give rise to nine -equivalence classes (the matroids and are -equivalent). Each of these matroids turns out to be an excluded minor for the class of -regular matroids.
Theorem 4.5.
There are exactly matroids that are excluded minors for the class of -regular matroids and have at most elements. These are:
and their duals; ; and , , , , , , and .
Proof.
Let be the set of all -element -connected -regular matroids with a -minor. Using a computer, we exhaustively generated the matroids in , for each (see Table 2). By Lemma 4.2, any excluded minor for the class of -regular matroids has at least elements. Let , and suppose all excluded minors for the class on fewer than elements are known. We generated all -connected single-element extensions of some matroid in ; let be this collection of matroids. From the collection , we filter out any matroids in , or any matroid containing, as a minor, one of the excluded minors for -regular matroids on fewer than elements; call the resulting collection . Clearly, any matroid in is an excluded minor for the class. In fact, if is an -element excluded minor not listed in Lemma 4.2(ii), then, by Lemmas 4.2 and 2.10, the collection contains at least one of and , so the complete list of -element excluded minors is obtained by closing under duality. Now, all excluded minors for the class on at most elements are known.
Next consider when . In order to utilise the contrapositive of Lemma 2.15, we consider -connected matroids with a -minor, so that, when and , we have . Let be the set of all -element -connected -regular matroids with a -minor. We exhaustively generated the matroids in , for each (see Table 3). For any (not necessarily non-isomorphic) pair of matroids and in , where and are both single-element extensions of some matroid , we find the splices of and . Let be the collection of all -element matroids that can be obtained in this way. From the collection , we filter out any matroids in , or any matroid containing, as a minor, one of the excluded minors for -regular matroids on at most elements; call the resulting collection . Clearly, any matroid in is an excluded minor for the class. In fact, if is an -element excluded minor, then, by Lemmas 4.2 and 2.14, either the collection contains a matroid that is -equivalent to or , or has a spiky -separator. But the latter contradicts Lemma 2.15. Therefore, the complete list of -element excluded minors is obtained by closing under duality and -equivalence. Now, all excluded minors for the class on at most elements are known.
For , the approach is similar to when , only we return to considering -connected -regular matroids with a -minor, for efficiency of the computations. Recall that is the set of such matroids on elements, and we have exhaustively generated the matroids in for . Let , and assume we know all excluded minors for the class on elements. For any (not necessarily non-isomorphic) pair of matroids and in , where and are both single-element extensions of some matroid , we find the splices of and . Let be the collection of all -element matroids that can be obtained in this way. We note that contained 7550463 matroids with rank 6, and 6788774 matroids with rank 7. From the collection , we filter out any matroids in , or any matroid containing, as a minor, one of the excluded minors for -regular matroids on at most elements; call the resulting collection . Clearly, any matroid in is an excluded minor for the class. In fact, if is an -element excluded minor, then, by Lemmas 4.2, 2.14 and 2.15, either the collection contains a matroid that is -equivalent to either or , or and is a quad-flower or a nest. But the latter contradicts Lemma 4.4. Therefore, the complete list of -element excluded minors is obtained by closing under duality and -equivalence. This completes the proof. ∎
| 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | |
|---|---|---|---|---|---|---|---|---|
| 2 | 1 | |||||||
| 3 | 2 | 2 | 3 | 4 | 3 | 2 | 1 | |
| 4 | 1 | 2 | 15 | 63 | 160 | 252 | 294 | 238 |
| 5 | 3 | 63 | 572 | 2969 | 9701 | 21766 | ||
| 6 | 4 | 160 | 2969 | 29288 | 172233 | |||
| 7 | 3 | 252 | 9701 | 172233 | ||||
| 8 | 2 | 294 | 21766 | |||||
| 9 | 1 | 238 | ||||||
| Total | 4 | 4 | 21 | 134 | 264 | 6446 | 49280 | 388474 |
| 5 | 6 | 7 | 8 | 9 | 10 | 11 | |
|---|---|---|---|---|---|---|---|
| 2 | 1 | 1 | |||||
| 3 | 1 | 3 | 4 | 7 | 7 | 5 | 2 |
| 4 | 1 | 4 | 32 | 125 | 273 | 384 | |
| 5 | 7 | 125 | 1074 | 5125 | |||
| 6 | 7 | 273 | 5125 | ||||
| 7 | 5 | 384 | |||||
| 8 | 2 | ||||||
| 9 | |||||||
| 10 | |||||||
| Total | 2 | 5 | 8 | 46 | 264 | 1630 | 11022 |
Comparing with the excluded minors for -regular matroids, note that instead of , , and , the matroids that appear as excluded minors for -regular matroids are either in , or can be obtained from by relaxing zero or more circuit-hyperplanes and then possibly dualising.
In Table 4, we show the excluded minors for -regular matroids, grouped by -equivalence classes, and, for those that are -representable, we provide the largest integer for which they are -representable. We also specify their universal partial field, if this partial field is well known.
| – | 6 | ||
| – | 2 | ||
| 2 | 2 | ||
| 2 | 2 | ||
| 4 | 4 | ||
| 2 | 2 | ||
| 4 | 2 | ||
| 2 | 2 | ||
| – | 2 | ||
| – | 2 | ||
| – | 3 | ||
| 2 | 1 | ||
| 2 | 1 | ||
| 4 | 1 | ||
| 2 | 1 |
Recall that the following was proved by Brettell, Oxley, Semple and Whittle [7].
Theorem 4.6 ([7, Theorem 1.1]).
An excluded minor for the class of -regular matroids has at most elements.
It is natural to ask the viability of using the techniques here (and in [8]) to find the excluded minors for -regular matroids on up to elements, in order to obtain a full excluded-minor characterisation for the class.
For obtaining the excluded minors for the class of -regular matroids, an important optimisation used in [8] is that any such excluded minor with at least elements is -representable, for otherwise it would also be an excluded minor for the class of -representable matroids (the largest of which is known to have elements [14]). Thus, there one can first find certain -representable matroids (as a “proxy” for -regular matroids), and then the potential excluded minors are -representable extensions (or splices) of these matroids. The same cannot be said for -regular matroids, where we consider certain -representable matroids (as a “proxy” for -regular matroids), and then must consider all extensions (or splices) of these matroids.
The upshot is, using more time or computing resources, one could probably extend Theorem 4.5 to matroids on 14 elements, but then another big step in computational power would still be required to tackle matroids on elements. A better approach seems some sort of compromise between an exhaustive computation and developing the theory in order to decrease the bound, as in [7]: that is, a computation that exploits structural results.
5. Excluded minors for -representable matroids when
In this section, we use the following notation. For , let be the set of excluded minors for the class of -representable matroids. For , let be the set of matroids in that are -representable. Using this notation, we have:
Lemma 5.1.
Let for some . Then either
-
(i)
has an -minor, or
-
(ii)
.
Moreover, the matroids in are strong -stabilizers by Lemma 2.7.
We consider now the computation of matroids in on at most elements, for . We first consider when , in which case, using Theorems 4.5 and 4, we can start from the following:
Lemma 5.2.
Suppose and . Then, either
-
(i)
or has a minor in , or
-
(ii)
is isomorphic to one of matroids in ; namely, or is isomorphic to a matroid in
Theorem 5.3.
There are excluded minors for -representability on at most elements.
Proof.
Let with . By Lemma 5.2, if is not one of the 26 matroids in Lemma 5.2(ii), then has an -minor, where is obtained by closing under duality.
Let denote the -element -connected -representable matroids with an -minor. Starting from each matroid , and using the fact that is a strong -stabilizer (by Lemma 2.7), we exhaustively generated the matroids in , for , see Table 5. Suppose all matroids in on fewer than elements are known, for some . We generated all -connected single-element extensions of some matroid in , then removed any matroids in , or any containing, as a minor, an excluded minor for the class of -representable matroids on fewer than elements. It follows from Lemma 2.10 that, after closing the resulting set of matroids under duality, we obtain all the matroids in having at most elements. ∎
| 7 | 8 | 9 | 10 | |
|---|---|---|---|---|
| 3 | 3 | 3 | 4 | 3 |
| 4 | 3 | 24 | 127 | 408 |
| 5 | 3 | 127 | 1747 | |
| 6 | 4 | 408 | ||
| 7 | 3 | |||
| Total | 6 | 30 | 262 | 2569 |
For the next layer of the hierarchy, the question becomes: which of the 63 excluded minors are -representable? It turns out that 20 of them are, as given in the next lemma. We provide -representations for these matroids in the appendix.
Note that some of these matroids are related to the well-known Pappus matroid [18, Page 655], which we denote as . After deleting an element from , the resulting matroid is unique up to isomorphism; we denote this matroid as . The matroid has a pair of free bases (see [10, Lemma 2.1]); tightening either one of these results in a matroid that we denote (the two possible matroids are isomorphic).
Lemma 5.4.
If and , then is one of the matroids obtained by closing the set
under duality.
Note that, by Theorems 5.3 and 5.4, there are 43 excluded minors for -representability that are also excluded minors for -representability.
Theorem 5.5.
There are excluded minors for -representability on at most elements.
Proof.
Essentially the same approach was taken as for the proof of Theorem 5.3, only using Lemma 5.4. The number of -element -connected -representable matroids with an -minor are given in Table 6. ∎
| 8 | 9 | 10 | |
|---|---|---|---|
| 3 | 2 | 3 | 1 |
| 4 | 9 | 65 | 231 |
| 5 | 2 | 65 | 1144 |
| 6 | 3 | 231 | |
| 7 | 1 | ||
| Total | 13 | 136 | 1608 |
Lemma 5.6.
If and , then is one of the matroids obtained by closing the set
under -equivalence and duality.
Note that, by Theorems 5.5 and 5.6, there are excluded minors for -representability that are also excluded minors for -representability.
Theorem 5.7.
There are excluded minors for -representability on at most elements.
Proof.
Again, we use a similar approach as in the proof of Theorems 5.5 and 5.3, only using Lemma 5.6. The number of -element -connected -representable matroids with an -minor are given in Table 7. ∎
| 7 | 8 | 9 | 10 | |
|---|---|---|---|---|
| 3 | 4 | 13 | 32 | 37 |
| 4 | 4 | 89 | 913 | 5125 |
| 5 | 13 | 913 | 21839 | |
| 6 | 32 | 5125 | ||
| 7 | 37 | |||
| Total | 8 | 115 | 1890 | 32163 |
Lemma 5.8.
If and , then is one of the matroids obtained by closing the set
under -equivalence and duality.
Let be a uniquely -representable matroid that is not dyadic. Then has an -minor. In particular, if , then or is -equivalent to a matroid that has an -minor, for some matroid listed in Lemma 5.8.
Note that, by Theorems 5.7 and 5.8, there are excluded minors for -representability that are also excluded minors for the class of -representable matroids.
Finally, we obtain our main result, Theorem 1.1, which we restate here.
Theorem 1.1.
There are excluded minors for -representability on elements.
Proof.
Again, we use a similar approach as in the proof of Theorems 5.3, 5.5 and 5.7, only this time using Lemma 5.8. The number of -element rank- -connected -representable matroids with an -minor are given in Table 8. ∎
| 8 | 9 | 10 | |
|---|---|---|---|
| 3 | 4 | 33 | 120 |
| 4 | 46 | 2237 | 51823 |
| 5 | 4 | 2237 | 327186 |
| 6 | 33 | 51823 | |
| 7 | 120 | ||
| Total | 54 | 4540 | 431072 |
6. Final remarks
In Table 9, we provide the number of excluded minors for -representability of each rank and size (up to at most 10 elements). We also consider the number of -equivalence classes for each size.
As remarked prior to Proposition 2.8, the excluded minors for representability over a partial field are closed not only under - exchange, but also under segment-cosegment exchange (a generalisation of - exchange) [19]. Thus, we could instead consider the number of equivalence classes under segment-cosegment exchange; however, the only effect would be merging two of the classes on elements, reducing the number of equivalence classes from to .
| #(matroids) | #(-classes) | ||
| 7 | 2 / 5 | 1 | |
| 3 / 4 | 5 | ||
| Total | 12 | 4 | |
| 8 | 3 / 5 | 2 | |
| 4 | 92 | ||
| Total | 96 | 73 | |
| 9 | 3 / 6 | 9 | |
| 4 / 5 | 219 | ||
| Total | 456 | 131 | |
| 10 | 3 / 7 | 1 | |
| 4 / 6 | 130 | ||
| 5 | 1866 | ||
| Total | 2128 | 920 |
Of the dual-closed -equivalence classes of -element excluded minors for the class of -representable matroids, of the classes consist of matroids that are not representable over any field. This corresponds to out of the excluded minors on elements.
A partial field is universal if it is the universal partial field of some matroid ; that is, . Van Zwam showed that several well-known partial fields are universal [26, Table 3.2], but commented that it was not known if each Hydra- partial field is universal, for [26, page 92]. It follows from Lemma 2.5 that . In the process of finding the excluded minors for , we were also able to find a matroid such that for each , thereby showing that each Hydra partial field is universal. These are given in Table 10. We note that each matroid in this table has at most elements.
References
- [1] S. Akkari and J. Oxley. Some local extremal connectivity results for matroids. Combinatorics, Probability and Computing, 2(04):367–384, 1993.
- [2] M. Baker and O. Lorscheid. Lift theorems for representations of matroids over pastures. arXiv:2107.00981, 2021.
- [3] R. E. Bixby. On Reid’s characterization of the ternary matroids. Journal of Combinatorial Theory, Series B, 26(2):174–204, 1979.
- [4] J. E. Bonin and W. R. Schmitt. Splicing matroids. European Journal of Combinatorics, 32:722–744.
- [5] N. Brettell. On the excluded minors for the class of matroids representable over all fields of size at least four. In preparation.
- [6] N. Brettell, B. Clark, J. Oxley, C. Semple, and G. Whittle. Excluded minors are almost fragile. Journal of Combinatorial Theory, Series B, 140:263–322, 2020.
- [7] N. Brettell, J. Oxley, C. Semple, and G. Whittle. The excluded minors for - and -regular matroids. Journal of Combinatorial Theory, Series B, 163:133–218, 2023.
- [8] N. Brettell and R. Pendavingh. Computing excluded minors for classes of matroids representable over partial fields. The Electronic Journal of Combinatorics, 31(P3.20):1–23, 2024.
- [9] N. Brettell, G. Whittle, and A. Williams. -detachable pairs in -connected matroids III: the theorem. Journal of Combinatorial Theory, Series B, 153:223–290, 2022.
- [10] R. Chen and G. Whittle. On recognizing frame and lifted-graphic matroids. Journal of Graph Theory, 87(1):72–76, 2018.
- [11] A. L. C. Cheung. Compatibility of extensions of a combinatorial geometry. Ph.D., University of Waterloo, 1974.
- [12] J. Geelen, B. Gerards, and G. Whittle. Solving Rota’s conjecture. Notices of the AMS, 61(7):736–743, 2014.
- [13] J. Geelen, J. Oxley, D. Vertigan, and G. Whittle. Weak maps and stabilizers of classes of matroids. Advances in Applied Mathematics, (21):305–341, 1998.
- [14] J. F. Geelen, A. M. H. Gerards, and A. Kapoor. The excluded minors for GF-representable matroids. Journal of Combinatorial Theory, Series B, 79(2):247–299, 2000.
- [15] R. Hall, D. Mayhew, and S. H. M. van Zwam. The excluded minors for near-regular matroids. European Journal of Combinatorics, 32(6):802–830, 2011.
- [16] D. Mayhew and G. F. Royle. Matroids with nine elements. Journal of Combinatorial Theory, Series B, 98(2):415–431, 2008.
- [17] W. Myrvold and J. Woodcock. A large set of torus obstructions and how they were discovered. The Electronic Journal of Combinatorics, 25(1.16):1–17, 2018.
- [18] J. Oxley. Matroid Theory, volume 21 of Oxford Graduate Texts in Mathematics. Oxford University Press, New York, second edition, 2011.
- [19] J. Oxley, C. Semple, and D. Vertigan. Generalized - exchange and -regular matroids. Journal of Combinatorial Theory, Series B, 79(1):1–65, 2000.
- [20] J. Oxley, D. Vertigan, and G. Whittle. On inequivalent representations of matroids over finite fields. Journal of Combinatorial Theory, Series B, 67:325–343, 1996.
- [21] R. A. Pendavingh and S. H. M. van Zwam. Confinement of matroid representations to subsets of partial fields. Journal of Combinatorial Theory, Series B, 100(6):510–545, 2010.
- [22] R. A. Pendavingh and S. H. M. van Zwam. Lifts of matroid representations over partial fields. Journal of Combinatorial Theory, Series B, 100(1):36–67, 2010.
- [23] C. A. Semple. -Regular Matroids. Ph.D., Victoria University of Wellington, 1998.
- [24] P. D. Seymour. Matroid representation over GF. Journal of Combinatorial Theory, Series B, 26(2):159–173, 1979.
- [25] W. T. Tutte. A homotopy theorem for matroids. I, II. Transactions of the American Mathematical Society, 88(1):144–174, 1958.
- [26] S. H. M. van Zwam. Partial Fields in Matroid Theory. Ph.D., Eindhoven University of Technology, 2009.
- [27] G. Whittle. On matroids representable over GF and other fields. Transactions of the American Mathematical Society, 349(2):579–603, 1997.
- [28] Y. Yu. More forbidden minors for wye-delta-wye reducibility. The Electronic Journal of Combinatorics, 13(R7):1–15, 2006.
Appendix
Here we provide representations for the -representable matroids appearing as excluded minors for -representable matroids, for some .
In what follows, matroids appear just once. That is, when is a excluded minor for the class of -representable matroids, and is -representable but not -representable for some , then appears in the “Excluded minors for -representable matroids” section under the “-representable” heading (but not in the “Excluded minors for -representable matroids” section, for example, despite also being an excluded minor for this class).
Matroids on at most nine elements are typically given the name , where is the number in Mayhew and Royle’s catalog of all matroids on at most nine elements. Exceptions are made for well-known matroids that have notation associated with them, or are free extensions or single-element deletions of such matroids, or for matroids that have been discovered in ongoing work on matroids representable over all fields of size at least four [5].
Excluded minors for -representable matroids
-
•
-representable:
: : : -
•
-representable:
: : : : : : :
Excluded minors for -representable matroids
-
•
-representable:
: : : : : : : : : -
•
-representable:
: : : : : : : : -
•
Uniquely -representable:
: :
Excluded minors for -representable matroids
-
•
-representable:
: : : : : : : : : : : : : : : : : : : : -
•
Uniquely -representable:
: : : : :
Excluded minors for -representable matroids
-
•
Uniquely -representable:
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :