Search arXivSearch

arXiv · 2607.20954

New excluded minors for the class $\mathcal{M}_3$ of regular matroids

Abstract

Engel, de Gaay Fortman, and Schreieder attach to each prime $\ell$ a minor-closed class $\mathcal{M}_\ell$ of regular matroids, whose excluded minors govern the failure of the integral Hodge conjecture for curve classes on very general principally polarized abelian varieties. For $\ell=2$ the class is the cographic matroids, with excluded minors $M(K_5)$ and $M(K_{3,3})$ by Tutte's theorem; for $\ell=3$ the only excluded minor explicitly identified so far is $M(K_{3,5})$, and the general characterization is [EGFS, Problem 8.8]. We exhibit five new excluded minors for $\mathcal{M}_3$, of ranks 8, 9, 9, 9, and 10; none contains $M(K_{3,5})$ or any of the other four as a minor, so the excluded-minor list of Problem 8.8 has at least six members, with excluded minors at every rank from 7 through 10. Combined with $M(K_7) \notin \mathcal{M}_3$, established by the same authors, and the minor-closedness of $\mathcal{M}_3$, some minor of $M(K_7)$ of rank between 4 and 6 is a further excluded minor, so the list has at least seven members, six of them explicitly identified. The list is structurally diverse: two bipartite apex constructions with automorphism group $S_4$, and three non-bipartite, non-planar rank-9 graphs with no such apex structure. Every verdict is certified by a finite $\mathbb{F}_3$-linear-algebra computation with explicit machine-checkable witnesses, cross-checked by independent implementations; the certificates further show that the five matroids lie outside the larger class $\widetilde{\mathcal{M}}_3$. We also record what are, to our knowledge, the first $\ell=5$ data on this corank-8 slice: $M(K_{3,5})$ and the rank-8 and rank-10 minors lie in $\mathcal{M}_5$ by explicit certificates, and the radical distance $d(M(K_{3,5}))=6$ is determined exactly.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Booker Smith. 2026-07-23. New excluded minors for the class $\mathcal{M}_3$ of regular matroids. https://arxiv.org/abs/2607.20954

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO