English
Related papers

Related papers: Intertwining connectivities in representable matro…

200 papers

We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…

Combinatorics · Mathematics 2026-03-11 Koji Imamura , Keisuke Shiromoto

An element $e$ of a $3$-connected matroid $M$ is elastic if ${\rm si}(M/e)$, the simplification of $M/e$, and ${\rm co}(M\backslash e)$, the cosimplification of $M\backslash e$, are both $3$-connected. It was recently shown that if…

Combinatorics · Mathematics 2022-07-20 George Drummond , Charles Semple

We consider the situation that M and N are 3-connected matroids such that |E(N)| > 3 and C* is a cocircuit of M with the property that M/y has an N-minor for some y in C*. We show that either there is an element x in C* such that si(M/x) or…

Combinatorics · Mathematics 2008-04-14 Rhiannon Hall , Dillon Mayhew

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Combinatorics · Mathematics 2014-04-25 Nathan Bowler , Johannes Carmesin

In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…

Combinatorics · Mathematics 2007-05-23 Massimiliano Lunelli , Antonio Laface

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

Combinatorics · Mathematics 2012-12-18 Nathan Bowler , Johannes Carmesin

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

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 2021-04-26 Nick Brettell , Geoff Whittle , Alan Williams

Let $\tilde{K}_{3,n}$, $n\geq 3$, be the simple graph obtained from $K_{3,n}$ by adding three edges to a vertex part of size three. We prove that if $H$ is a hyperplane of a 3-connected matroid $M$ and $M \not\cong M^*(\tilde{K}_{3,n})$,…

Combinatorics · Mathematics 2008-02-26 Rhiannon Hall

Let $M$ be a representable matroid on $n$ elements. We give bounds, in terms of $n$, on the least positive characteristic and smallest field over which $M$ is representable.

Combinatorics · Mathematics 2019-10-28 Jason Bell , Daryl Funk , Byoung Du Kim , Dillon Mayhew

A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…

Combinatorics · Mathematics 2017-03-06 Amanda Cameron , Dillon Mayhew

An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

Let $M$ be a $3$-connected matroid. A pair $\{e,f\}$ in $M$ is detachable if $M \backslash e \backslash f$ or $M / e / f$ is $3$-connected. Williams (2015) proved that if $M$ has at least 13 elements, then at least one of the following…

Combinatorics · Mathematics 2025-09-15 Nick Brettell , Charles Semple , Gerry Toft

We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…

Combinatorics · Mathematics 2023-06-01 J. Sun , S. B. Damelin

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

Combinatorics · Mathematics 2025-02-20 Carles Padró

Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P' of P. We say that B confines M to P' if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Combinatorics · Mathematics 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

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