English
Related papers

Related papers: The excluded minors for GF(5)-representable matroi…

200 papers

Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb P$, and let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary. We prove that either $M$ is bounded…

Combinatorics · Mathematics 2021-02-04 Nick Brettell , Ben Clark , James Oxley , Charles Semple , Geoff Whittle

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

Let ${\bf A}={\bf A}_{n,m,k}$ be a random $n\times m$ matrix over $\mathbf{GF}_2$ wher each column consists of $k$ randomly chosen ones. Let $M$ be an arbirary fixed binary matroid. We show that if $m/n$ and $k$ are sufficiently large then…

Combinatorics · Mathematics 2019-03-13 Colin Cooper , Alan Frieze , Wesley Pegden

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

Combinatorics · Mathematics 2025-03-17 Jagdeep Singh

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…

Combinatorics · Mathematics 2025-02-24 Michael Bamiloshin , Oriol Farràs , Carles Padró

In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to: U2,5; U3,5; the Fano plane and its dual; the non-Fano and its dual; the single-element deletion of AG(2,3), its dual, and the…

Combinatorics · Mathematics 2009-07-12 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…

Combinatorics · Mathematics 2015-03-13 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

Combinatorics · Mathematics 2020-06-02 Rutger Campbell , Kevin Grace , James Oxley , Geoff Whittle

We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this cataogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn,…

Combinatorics · Mathematics 2007-05-23 Dillon Mayhew , Gordon F. Royle

We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.

Combinatorics · Mathematics 2015-11-12 Shalev Ben-David , Jim Geelen

A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property…

Combinatorics · Mathematics 2014-01-29 Peter Nelson , Stefan H. M. van Zwam

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

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

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Peter Nelson

A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is…

Combinatorics · Mathematics 2021-11-10 Peter Nelson , Zach Walsh

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

Combinatorics · Mathematics 2011-05-23 Peter Nelson

For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…

Combinatorics · Mathematics 2011-08-02 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

It is proved that, for a prime number $p$, showing that an $n$-element matroid is not representable over $GF(p)$ requires only $O(n^2)$ rank evaluations.

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle