English
Related papers

Related papers: Taking minors without splitting tangles

200 papers

A matroid of rank $r$ on $n$ elements is a positroid if it has a representation by an $r$ by $n$ matrix over $\mathbb{R}$, each $r$ by $r$ submatrix of which has nonnegative determinant. Earlier characterizations of connected positroids and…

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

We use counting arguments to show that asymptotically almost all sparse paving matroids contain an $H$-minor, where $H$ falls into one of several simple classes of matroids. Furthermore the result holds for all $H$ in a larger class of…

Combinatorics · Mathematics 2016-05-10 Will Critchlow

We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly…

Combinatorics · Mathematics 2014-08-07 David Eppstein

The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…

Combinatorics · Mathematics 2015-09-15 S. R. Kingan , Manoel Lemos

We determine the smallest simple triangle-free binary matroids that have no five-element independent flat. This solves a special case of a conjecture of Nelson and Norin.

Combinatorics · Mathematics 2020-11-03 Peter Nelson , Kazuhiro Nomoto

We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…

Combinatorics · Mathematics 2025-05-16 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…

Combinatorics · Mathematics 2024-02-15 Brahim Chaourar

A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable…

Combinatorics · Mathematics 2019-08-01 Dillon Mayhew , Mike Newman , Geoff Whittle

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

We use the Strong Splitter Theorem to decompose the excluded minor class of binary matroids with no $E_4$-minor. Using this theorem we can get the 3-decomposers and the extremal internally 4-connected matroids as well as any other important…

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

We prove an "h-principle without pre-conditions" for the elimination of tangencies of a Lagrangian submanifold with respect to a Lagrangian distribution. The main result states that such tangencies can always be completely removed at the…

Symplectic Geometry · Mathematics 2022-02-15 Daniel Alvarez-Gavela , Yakov Eliashberg , David Nadler

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

Commutative Algebra · Mathematics 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

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

We prove that, as $n$ approaches infinity, the proportion of $n$-element matroids that are representable tends to zero.

Combinatorics · Mathematics 2018-01-31 Peter Nelson

We introduce a new axiomatization of matroid theory that requires the elimination property only among modular pairs of circuits, and we present a cryptomorphic phrasing thereof in terms of Crapo's axioms for flats. This new point of view…

Combinatorics · Mathematics 2016-08-23 Emanuele Delucchi

It is known that the Chow ring of a matroid satisfies the Hard Lefschetz property and Hodge Riemann relations. We provide a proof of this theorem by decomposition of the deletion operation into star subdivisions at two dimensional cones.…

Combinatorics · Mathematics 2025-09-16 Andy Hsiao

Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following…

Combinatorics · Mathematics 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley

Splitting operation in Matroid Theory does not preserve graphicness, connectedness, cographicness, etc. Also, the splitting of binary gammoid does not necessarily be binary gammoid after splitting. We have characterized a class of graphic…

Combinatorics · Mathematics 2023-10-06 S. D. Solanki , S. B. Dhotre

This paper examines the problem of obtaining a $D(4)$-quadruple by adding a smaller element to a $D(4)$-triple. We prove some relations between elements of observed hypothetical $D(4)$-quadruples under which conjecture of the uniqueness of…

Number Theory · Mathematics 2026-03-12 Marija Bliznac Trebješanin , Pavao Radić

We describe an implementation of a computer search for the "small" excluded minors for a class of matroids representable over a partial field. Using these techniques, we enumerate the excluded minors on at most 15 elements for both the…

Combinatorics · Mathematics 2024-08-27 Nick Brettell , Rudi Pendavingh