Related papers: A matroid extension result
In this paper we describe a parallel algorithm for generating all non-isomorphic rank $3$ simple matroids with a given multiplicity vector. We apply our implementation in the HPC version of GAP to generate all rank $3$ simple matroids with…
There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…
Let $F_g$ be the closed orientable surface of genus $g$. We address the problem to extend torsion elements of the mapping class group ${\mathcal{M}}(F_g)$ over the 4-sphere $S^4$. Let $w_g$ be a torsion element of maximum order in…
We consider matroids with the property that every subset of the ground set of size $t$ is contained in both an $\ell$-element circuit and an $\ell$-element cocircuit; we say that such a matroid has the $(t,\ell)$-property. We show that for…
A set function can be extended to the unit cube in various ways; the correlation gap measures the ratio between two natural extensions. This quantity has been identified as the performance guarantee in a range of approximation algorithms…
Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where…
Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…
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…
We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…
For all positive integers $s$ and $t$ exceeding one, a matroid $M$ on $n$ elements is {\em nearly $(s, t)$-cyclic} if there is a cyclic ordering $\sigma$ of its ground set such that every $s-1$ consecutive elements of $\sigma$ are contained…
We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…
Binary delta-matroids are closed under vertex flips, which consist of the natural operations of twist and loop complementation. In this note we provide an extension of this result from GF(2) to GF(4). As a consequence, quaternary matroids…
We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this cataogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn,…
This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].
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…
A matroid M is cyclically orderable if there is a cyclic permutation of the elements of M such that any r consecutive elements form a basis in M. An old conjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically…
An 'induced restriction' of a simple binary matroid $M$ is a restriction $M|F$, where $F$ is a flat of $M$. We consider the class $\mathcal{M}$ of all simple binary matroids $M$ containing neither a free matroid on three elements (which we…
The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…
A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…
For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…