English
Related papers

Related papers: The smallest matroids with no large independent fl…

200 papers

We show that, if $\alpha > 0$ is a real number, $n \ge 2$ and $\ell \ge 2$ are integers, and $q$ is a prime power, then every simple matroid $M$ of sufficiently large rank, with no $U_{2,\ell}$-minor, no rank-$n$ projective geometry minor…

Combinatorics · Mathematics 2012-10-17 Jim Geelen , Peter Nelson

We construct a $\wedge$-homogeneous universal simple matroid of rank $3$, i.e. a countable simple rank~$3$ matroid $M_*$ which $\wedge$-embeds every finite simple rank $3$ matroid, and such that every isomorphism between finite…

Logic · Mathematics 2018-10-04 Gianluca Paolini

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

Combinatorics · Mathematics 2025-03-20 Bill Jackson , Shin-ichi Tanigawa

We introduce the singular cohomology ring of a matroid which extends the Chow ring of a matroid. This is defined as the singular cohomology ring of a certain quasi-projective toric variety associated to the matroid. Using the matroidal…

Combinatorics · Mathematics 2026-03-20 Kyle Binder

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

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

Let $M$ be a representable matroid, and $Q, R, S, T$ subsets of the ground set. We prove that, if $M$ is sufficiently large, then there is an element $e$ such that deleting or contracting $e$ preserves both the $Q$-$R$ and the $S$-$T$…

Combinatorics · Mathematics 2018-01-16 Tony Huynh , Stefan van Zwam

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

We prove that any element in a matroid can be removed, by either deletion or contraction, in such a way that no tangle "splits".

Combinatorics · Mathematics 2025-12-12 Jim Geelen

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Carolyn Chun , Tara Fife

We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may play in the following problem: as a…

Combinatorics · Mathematics 2010-11-05 Joseph E. Bonin

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

Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact has become the most fundamental theorem in linear algebra such that we may favor it in an unconscious way. The sole aim of this paper is to…

History and Overview · Mathematics 2022-07-29 Jun Lu

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

In earlier work, we characterized the class of matroids with no $M(C_4)$ as an induced minor and the class of matroids with no member of $\{M(C_4),M(K_4)\}$ as an induced minor. In this paper, for every two matroids in…

Combinatorics · Mathematics 2024-12-10 James Dylan Douthitt , James Oxley

The closure $\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this…

Combinatorics · Mathematics 2021-10-19 Marc Hellmuth , Carsten R. Seemann

For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…

Combinatorics · Mathematics 2017-01-06 Ron Aharoni , Eli Berger , Dani Kotlar , Ran Ziv

We prove that the non-regular binary matroids with no $P_9^*$-minor have linear growth rate and the maximum size binary matroids with no $P_9^*$-minor are graphic. The main technique in the proof is the Strong Splitter Theorem using which…

Combinatorics · Mathematics 2014-12-30 S. R. Kingan

The sticky polymatroid conjecture states that any two extensions of the polymatroid have an amalgam if and only if the polymatroid has no non-modular pairs of flats. We show that the conjecture holds for polymatroids on five or less…

Information Theory · Computer Science 2020-02-04 Laszlo Csirmaz
‹ Prev 1 3 4 5 6 7 10 Next ›