English
Related papers

Related papers: On two classes of nearly binary matroids

200 papers

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

Combinatorics · Mathematics 2024-03-07 Kevin Purbhoo

Let $\mathcal{N}$ be a set of matroids. A matroid $M$ is strictly $\mathcal{N}$-fragile if $M$ has a member of $\mathcal{N}$ as minor and, for all $e \in E(M)$, at least one of $M\backslash e$ and $M/e$ has no minor in $\mathcal{N}$. In…

Combinatorics · Mathematics 2015-11-10 Ben Clark , Dillon Mayhew , Stefan van Zwam , Geoff Whittle

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

The effect of replacing a basis element on the way the basis spans other elements is studied. This leads to a new characterization of binary matroids.

Combinatorics · Mathematics 2012-03-02 Daniel Kotlar

In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$…

Combinatorics · Mathematics 2019-06-27 Ragnar Freij-Hollanti , Matthias Grezet , Camilla Hollanti , Thomas Westerbäck

We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…

Combinatorics · Mathematics 2012-07-10 Elad Aigner-Horev , Johannes Carmesin , Jan-Oliver Fröhlich

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

Combinatorics · Mathematics 2015-10-26 Leonidas Pitsoulis , Eleni-Maria Vretta

Associated to each simplicial complex is a binary hierarchical model. We classify the simplicial complexes that yield unimodular binary hierarchical models. Our main theorem provides both a construction of all unimodular binary hierarchical…

Combinatorics · Mathematics 2016-02-19 Daniel Irving Bernstein , Seth Sullivant

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 Jim Geelen , Peter Nelson

If $\mathcal{C}$ is a minor-closed class of matroids, then the class $\widetilde{\mathcal{C}}'_k$ of $k$-polymatroids whose $k$-natural matroids are in $\mathcal{C}$ is also minor-closed. We investigate the following question: When…

Combinatorics · Mathematics 2023-04-07 Fiona Young

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an…

Combinatorics · Mathematics 2022-01-04 Nick Brettell , Geoff Whittle , Alan Williams

The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…

Combinatorics · Mathematics 2023-12-01 Fiona Young

Mayhew and Royle (2008) showed that there are 564 excluded minors for the class of GF(5)-representable matroids having at most 9 elements. We enumerate the excluded minors for GF(5)-representable matroids having 10 elements: there are…

Combinatorics · Mathematics 2025-04-17 Nick Brettell

The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…

Quantum Algebra · Mathematics 2026-03-23 Gandalf Lechner

We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…

Rings and Algebras · Mathematics 2023-01-31 Zarathustra Brady

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. We say that a pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and…

Combinatorics · Mathematics 2020-02-25 Nick Brettell , Geoff Whittle , Alan Williams

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle