Related papers: Improved bounds for Rota's Basis Conjecture

It is well known that a matroid L is a lift of a matroid M if and only if every circuit of L is the union of some circuits of M. In this paper we give a simpler proof of this important theorem. We also described a discrete homotopy theorem…

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.

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

The matroid-based valuation conjecture of Ostrovsky and Paes Leme states that all gross substitutes valuations on $n$ items can be produced from merging and endowments of weighted ranks of matroids defined on at most $m(n)$ items. We show…

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…

A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for…

Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…

An open problem in convex geometry asks whether two simplices $A,B\subseteq\mathbb{R}^d$, both containing the origin in their convex hulls, admit a polynomial-length sequence of vertex exchanges transforming $A$ into $B$ while maintaining…

Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…

In this paper, we establish a one-to-one correspondence between the set of biclosed sets in an irreducible root system of type $A_n$ and the set of quasitrivial semigroup structures on a set with $n+1$ elements. Building on this…

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

We give the following extension of Barany's colorful Caratheodory theorem: Let M be an oriented matroid and N a matroid with rank function r, both defined on the same ground set V and satisfying rank(M) < rank(N). If every subset A of V…

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.

A positroid is the matroid of a matrix whose maximal minors are all nonnegative. Given a permutation $w$ in $S_n$, the matroid of a generic $n \times n$ matrix whose non-zero entries in row $i$ lie in columns $w(i)$ through $n+i$ is an…

A fundamental question in parallel computation, posed by Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988), asks: \emph{given only independence-oracle access to a matroid on $n$ elements, how many rounds are required to find a basis using…

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

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…

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has…