Related papers: Intersection theory of polymatroids
We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate…
The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…
Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…
A class of matroids is introduced which is very large as it strictly contains all paving matroids as special cases. As their key feature these split matroids can be studied via techniques from polyhedral geometry. It turns out that the…
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…
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 construct a combinatorial generalization of the Leray models for hyperplane arrangement complements. Given a matroid and some combinatorial blowup data, we give a presentation for a bigraded (commutative) differential-graded algebra. If…
The Chow polynomial of a matroid is a fundamental invariant whose coefficients exhibit strong positivity properties, including $\gamma$-positivity. We interpret the normalized Chow coefficients as a probability distribution and establish…
Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the weighted version of the problem, the goal is to find a…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
We use techniques from Gromov-Witten theory to construct new invariants of matroids taking value in the Chow groups of spaces of rational curves in the permutohedral toric variety. When the matroid is realizable by a complex hyperplane…
The concept of matchings originated in group theory to address a linear algebra problem related to canonical forms for symmetric tensors. In an abelian group $(G,+)$, a matching is a bijection $f: A \to B$ between two finite subsets $A$ and…
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
The study of intersection problems in Extremal Combinatorics dates back perhaps to 1938, when Paul Erd\H{o}s, Chao Ko and Richard Rado proved the (first) `Erd\H{o}s-Ko-Rado theorem' on the maximum possible size of an intersecting family of…
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
The discrete polymatroids and their base rings are studied recently in many papers (see \cite{HH}, \cite{HHV}, \cite{V1}, \cite{V2}). It is important to give conditions when the base ring associated to a transversal polymatroid is…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve E with complex multiplication. We analyse the intersections of elements of the arrangement and their connected components as…