Geometric Bijections for Regular Matroids, Zonotopes, and Ehrhart Theory
arXiv:1701.01051 · doi:10.1017/fms.2019.40
Abstract
Let be a regular matroid. The Jacobian group of is a finite abelian group whose cardinality is equal to the number of bases of . This group generalizes the definition of the Jacobian group (also known as the critical group or sandpile group) of a graph (in which case bases of the corresponding regular matroid are spanning trees of ). There are many explicit combinatorial bijections in the literature between the Jacobian group of a graph and spanning trees. However, most of the known bijections use vertices of in some essential way and are inherently "non-matroidal". In this paper, we construct a family of explicit and easy-to-describe bijections between the Jacobian group of a regular matroid and bases of , many instances of which are new even in the case of graphs. We first describe our family of bijections in a purely combinatorial way in terms of orientations; more specifically, we prove that the Jacobian group of admits a canonical simply transitive action on the set of circuit-cocircuit reversal classes of , and then define a family of combinatorial bijections between and bases of . (Here (resp. ) is an acyclic signature of the set of circuits (resp. cocircuits) of .) We then give a geometric interpretation of each such map in terms of zonotopal subdivisions which is used to verify that is indeed a bijection. Finally, we give a combinatorial interpretation of lattice points in the zonotope ; by passing to dilations we obtain a new derivation of Stanley's formula linking the Ehrhart polynomial of to the Tutte polynomial of .
v2: 39 pages, 5 figures, include a partial extension to realizable oriented matroids (cf. Section 1.5); v3: improved exposition
References in corpus (2)
Cited by in corpus (7)
- Kirchhoff's theorem for Prym varieties
- A family of matrix-tree multijections
- Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs
- A Consistent Sandpile Torsor Algorithm for Regular Matroids
- Semi-polytope decomposition of a Generalized permutohedron
- Fragmenting any Parallelepiped into a Signed Tiling
- Extension-lifting Bijections for Oriented Matroids