Related papers: Unique expansion matroids and union minimal matroi…
Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…
We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…
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…
In the theory of classical matroids, there are several known equivalent axiomatic systems that define a matroid, which are described as matroid cryptomorphisms. A q-matroid is a q-analogue of a matroid where subspaces play the role of the…
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…
Given a root system $\mathsf{R}$, the vector system $\tilde{\mathsf{R}}$ is obtained by taking a representative $v$ in each antipodal pair $\{v, -v\}$. The matroid $M(\mathsf{R})$ is formed by all independent subsets of…
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)$.
Alternate bases are a numeration system that generalizes the R\'enyi numeration system. It is common in this context to construct examples or counter-examples by specifying the expansions of $1$ in the desired system. While it is easy to…
We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$.…
The splitting operation on a $p$-matroid does not necessarily preserve connectivity. It is observed that there exists a single element extension of the splitting matroid which is connected. In this paper, we define the element splitting…
One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…
We study some properties of a serial (i.e. one-by-one) symmetric exchange of elements of two disjoint bases of a matroid. We show that any two elements of one base have a serial symmetric exchange with some two elements of the other base.…
In this paper we introduce a $q$-analogue of the single-element extensions of matroids for $q$-matroids, which we call one-dimensional extensions. To enumerate such extensions, we define a $q$-analogue of modular cuts and define a certain…
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…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. Under quite mild conditions such a set of matrices admits…
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…
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.
This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why they are (not) cryptomorphic. Also, we explain the…
DeVos, Kwon, and Oum introduced the concept of branch-depth of matroids as a natural analogue of tree-depth of graphs. They conjectured that a matroid of sufficiently large branch-depth contains the uniform matroid $U_{n,2n}$ or the cycle…
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…