English
Related papers

Related papers: Detecting minors in matroids through triangles

200 papers

Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…

Combinatorics · Mathematics 2020-06-17 Ilan Adler , Jesús A. De Loera , Steven Klee , Zhenyang Zhang

We present two characterizations of regular matroids among orientable matroids and use them to give a measure of "how far" an orientable matroid is from being regular.

Combinatorics · Mathematics 2019-07-04 Libby Taylor

We present a number of lower bounds for the h-vectors of k-CM, broken circuit and independence complexes. These lead to bounds on the coefficients of the characteristic and reliability polynomials of matroids. The main techniques are the…

Combinatorics · Mathematics 2007-05-23 Edward Swartz

Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…

Algebraic Geometry · Mathematics 2018-06-18 Dustin Cartwright

The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and contains both the class of lifted-graphic matroids and the class of frame matroids, each of which generalises the class of graphic…

Combinatorics · Mathematics 2022-05-26 Rong Chen

We determine sufficient conditions for certain classes of $(n+k) \times n$ matrices $E$ to have all order-$n$ minors to be nonzero. For a special class of $(n+1) \times n$ matrices $E,$ we give the formula for the order-$n$ minors. As an…

Functional Analysis · Mathematics 2020-08-12 Priyabrata Bag , Santanu Dey , Masaru Nagisa , Hiroyuki Osaka

The classes of bicircular matroids and lattice path matroids are closed under minors. The complete list of excluded minors for the class of lattice path matroids is known, and it has been recently shown that the analogous list for the class…

Combinatorics · Mathematics 2024-02-20 Emma Hogan , Charles Semple

Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…

Combinatorics · Mathematics 2012-01-17 Christian Joseph Altomare

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

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

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contains H as a rooted subgraph, subdivision, or immersion; we…

Combinatorics · Mathematics 2012-07-27 André Kündgen , Michael J. Pelsmajer , Radhika Ramamurthi

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

We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded…

Combinatorics · Mathematics 2021-10-19 Joseph Bonin , Carolyn Chun , Tara Fife

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

Data Structures and Algorithms · Computer Science 2017-10-09 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

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

Given a seminormal affine monoid M we consider several monoid properties of M and their connections to ring properties of the associated affine monoid ring K[M] over a field K. We characterize when K[M] satisfies Serre's condition (S_2) and…

Commutative Algebra · Mathematics 2021-05-18 Winfried Bruns , Ping Li , Tim Roemer

We present infinite sequences of excluded minors for both the class of lifted-graphic matroids and the class of frame matroids.

Combinatorics · Mathematics 2018-04-19 Rong Chen , Jim Geelen

We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…

Combinatorics · Mathematics 2018-12-10 Jérémie Chalopin , Victor Chepoi , Damian Osajda