Related papers: Positroid envelopes and graphic positroids
A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…
The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic matroid is Gorenstein.
We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Mat\'us are equivalent to compatibility with…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
We show for each positive integer $a$ that, if $\mathcal{M}$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $c$ such that either every rank-$r$ matroid in $\mathcal{M}$ can…
Flag matroids are a rich family of Coxeter matroids that can be characterized using pairs of matroids that form a quotient. We consider a class of matroids called positroids, introduced by Postnikov, and utilize their combinatorial…
We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspective allows us to generalize the construction of underlying…
In this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of…
An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the case analysis in the proof.
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
Using Postnikov's Le-diagrams, decorated permutations, and Grassmann necklaces, we classify which positroids are sparse paving matroids. This allows us to enumerate sparse paving positroids, making connections to a known sequence involving…
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…
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…
Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…
Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…
In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…