English
Related papers

Related papers: On the Quotient-Lift Matroid Relation

200 papers

Las Vergnas introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted that when computing the Moebius function of these lattices, it was often zero, although he…

Combinatorics · Mathematics 2007-05-23 Rieuwert Blok , Bruce Sagan

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

Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…

Combinatorics · Mathematics 2021-01-07 Amanda Cameron , Dillon Mayhew

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

Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…

Combinatorics · Mathematics 2012-11-27 João Paulo Costalonga

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

We consider structural properties of $\mathcal{L}$-polymatroids, especially those defined on a finite complemented modular lattice $\mathcal{L}$. We introduce a set of cover-weight axioms and establish a cryptomorphism between these axioms…

Combinatorics · Mathematics 2025-12-30 Eimear Byrne , Andrew Fulcher

We present a level raising result for families of p-adic automorphic forms for a definite quaternion algebra D over the rational numbers. The main theorem is an analogue of a theorem for classical automorphic forms due to Diamond and…

Number Theory · Mathematics 2011-07-06 James Newton

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…

Combinatorics · Mathematics 2026-01-08 Or Raz

It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via a monomial substitution. Moreover, the q-matroid itself and…

Combinatorics · Mathematics 2025-09-29 Heide Gluesing-Luerssen , Benjamin Jany

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 establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

Combinatorics · Mathematics 2015-09-02 João Paulo Costalonga

Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.

Combinatorics · Mathematics 2018-12-05 Ganesh Mundhe , Y. M. Borse

We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…

Combinatorics · Mathematics 2024-10-22 Usman Ali , Iffat Fida Hussain

In this paper, we introduce the terminology of matroids into the study of Zariski-pairs related to rational elliptic surfaces, aiming to simplify the presentation and arguments involved. As an application, we provide new examples of Zariski…

Algebraic Geometry · Mathematics 2019-02-14 Ryutaro Sato , Shinzo Bannai

Let $\mathfrak g_i$ be a simple complex Lie algebra, $1\leq i \leq d$, and let $G=G_1\times...\times G_d$ be the corresponding adjoint group. Consider the $G$-module $V=\oplus r_i\mathfrak g_i$ where $r_i\geq 1$ for all $i$. We say that $V$…

Representation Theory · Mathematics 2013-11-26 Gerald W. Schwarz

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

Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G…

Combinatorics · Mathematics 2016-10-20 Robert Brijder , Lorenzo Traldi

Let X be a compact manifold with a smooth action of a compact connected Lie group G. Let $L\to X$ be a complex line bundle. Using the Cartan complex for equivariant cohomology, we give a new proof of a theorem of Hattori and Yoshida which…

Differential Geometry · Mathematics 2007-05-23 Ignasi Mundet i Riera

Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets…

Combinatorics · Mathematics 2017-06-27 James Oxley , Charles Semple , Geoff Whittle