English
Related papers

Related papers: The excluded minors for near-regular matroids

200 papers

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

Combinatorics · Mathematics 2014-02-25 Jim Geelen

Let $EX[M_1\dots, M_k]$ denote the class of binary matroids with no minors isomorphic to $M_1, \dots, M_k$. In this paper we give a decomposition theorem for $EX[S_{10}, S_{10}^*]$, where $S_{10}$ is a certain 10-element rank-4 matroid. As…

Combinatorics · Mathematics 2014-05-21 Sandra Kingan

Subject to announced results by Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unity matroids.

Combinatorics · Mathematics 2021-08-17 Ben Clark , Kevin Grace , James Oxley , Stefan H. M. van Zwam

A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…

Combinatorics · Mathematics 2011-07-08 Harald Fripertinger , Marcel Wild

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

Combinatorics · Mathematics 2025-12-18 Jonathan Boretsky , Zach Walsh

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

Combinatorics · Mathematics 2013-10-01 J. A. De Loera , J. Lee , S. Margulies , J. Miller

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…

Combinatorics · Mathematics 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

The presence or absense of renormalon singularities in the Borel plane is shown to be determined by the analytic properties of the Gell-Mann - Low function \beta(g) and some other functions. A constructive criterion for the absense of…

High Energy Physics - Phenomenology · Physics 2014-11-18 I. M. Suslov

We show that, if $q$ is a prime power at most 5, then every rank-$r$ matroid with no $U_{2,q+2}$-minor has no more lines than a rank-$r$ projective geometry over GF$(q)$. We also give examples showing that for every other prime power this…

Combinatorics · Mathematics 2013-06-12 Jim Geelen , Peter Nelson

DeVos, Kwon, and Oum introduced the concept of branch-depth of matroids as a natural analogue of tree-depth of graphs. They conjectured that a matroid of sufficiently large branch-depth contains the uniform matroid $U_{n,2n}$ or the cycle…

Combinatorics · Mathematics 2021-05-21 J. Pascal Gollin , Kevin Hendrey , Dillon Mayhew , Sang-il Oum

In this article we prove that the union of two almost orthogonal planes in R4 is Almgren-minimal. This gives an example of a one parameter family of minimal cones, which is a phenomenon that does not exist in R3. This work is motivated by…

Classical Analysis and ODEs · Mathematics 2014-02-26 Xiangyu Liang

We investigate the set of excluded minors of connectivity 2 for the class of frame matroids. We exhibit a list $\mathcal{E}$ of 18 such matroids, and show that if $N$ is such an excluded minor, then either $N \in \mathcal{E}$ or $N$ is a…

Combinatorics · Mathematics 2016-11-08 Matt DeVos , Daryl Funk , Irene Pivotto

For a matroid $M$ of rank $r$ on $n$ elements, let $b(M)$ denote the fraction of bases of $M$ among the subsets of the ground set with cardinality $r$. We show that $$\Omega(1/n)\leq 1-b(M)\leq O(\log(n)^3/n)\text{ as }n\rightarrow \infty$$…

Combinatorics · Mathematics 2016-10-24 Rudi Pendavingh , Jorn van der Pol

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

Combinatorics · Mathematics 2011-05-23 Jim Geelen , Peter Nelson

We prove that for every bipartite graph $H$ and positive integer $s$, the class of $K_{s,s}$-subgraph-free graphs excluding $H$ as a pivot-minor has bounded average degree. Our proof relies on the announced binary matroid structure theorem…

Combinatorics · Mathematics 2026-03-24 Rutger Campbell , James Davies , Robert Hickingbotham

We characterize the class of threshold matroids by the structure of their defining bases. We also give an example of a shifted matroid which is not threshold, answering a question of Deza and Onn. We conclude by exploring consequences of…

Combinatorics · Mathematics 2025-09-01 Ethan Partida

Geelen, Gerards, and Whittle [3] announced the following result: let $q = p^k$ be a prime power, and let $\mathcal{M}$ be a proper minor-closed class of $\mathrm{GF}(q)$-representable matroids, which does not contain $\mathrm{PG}(r-1,p)$…

Combinatorics · Mathematics 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…

Combinatorics · Mathematics 2021-01-07 Amanda Cameron , Dillon Mayhew