Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMatroid polytopes and their volumes
150
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian $Gr_{k,n}$. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of $M$. Our proofs are based on a natural extension of Postnikovs theory of generalized permutohedra.
rate research
Read More
We introduce the notion of real phase structure on rational polyhedral fans in Euclidean space. Such a structure consists of an assignment of affine spaces over $mathbb{Z}/2mathbb{Z}$ to each top dimensional face of the fan subject to two conditions. Given an oriented matroid we can construct a real phase structure on the fan of the underlying matroid. Conversely, we show that from a real phase structure on a matroid fan we can produce an orientation of the underlying matroid. Thus real phase structures are cryptomorphic to matroid orientations. The topes of the orientated matroid are recovered immediately from the real phase structure. We also provide a direct way to recover the signed circuits of the oriented matroid from the real phase structure.
We give a criterion for modular extension of rank-4 hypermodular matroids, and prove a weakening of Kantors conjecture for rank-4 realizable matroids. This proves the sticky matroid conjecture and Kantors conjecture for realizable matroids due to an argument of Bachem, Kern, and Bonin, and due to an equivalence argument of Hochstattler and Wilhelmi, respectively.
We show Kantors conjecture (1974) holds in rank 4. This proves both the sticky matroid conjecture of Poljak and Turzik (1982) and the whole Kantors conjecture, due to an argument of Bachem, Kern, and Bonin, and an equivalence argument of Hochstattler and Wilhelmi, respectively.
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergnes generalization of a volume formula originally due to Lidskii. We recover known flow polytope volume formulas and prove new volume formulas for flow polytopes that were seemingly unapproachable. A highlight of our model is an elegant formula for the flow polytope of a graph we call the caracol graph. As by-products of our work, we uncover a new triangle of numbers that interpolates between Catalan numbers and the number of parking functions, we prove the log-concavity of rows of this triangle along with other sequences derived from volume computations, and we introduce a new Ehrhart-like polynomial for flow polytope volume and conjecture product formulas for the polytopes we consider.
We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as newly-defined polytopes whose vertices correspond to noncrossing set partitions. In analogy with matroid basis polytopes, the second class is obtained by considering the stable sets of maximal cardinality. We investigate how the class of $0/1$-polytopes whose edges satisfy our characterization is situated within the hierarchy of $0/1$-polytopes. This includes the class of matroid polytopes. We also study the diameter of these classes of polytopes and improve slightly on the Hirsch bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
