Ehrhart Theory of Paving and Panhandle Matroids
Derek Hanely, Jeremy L. Martin, Daniel McGinnis, Dane Miyata, George, D. Nasr, Andr\'es R. Vindas-Mel\'endez, Mei Yin

TL;DR
This paper develops a systematic method to compute Ehrhart polynomials of paving matroids by relating their base polytopes to hypersimplices and lattice path matroids, extending previous work and exploring Ehrhart positivity.
Contribution
It introduces a new geometric construction for paving matroids' base polytopes, generalizes existing formulas, and applies these results to matroids from Steiner systems and projective planes.
Findings
Ehrhart polynomials of paving matroids can be derived from hypersimplex slices.
Evidence suggests panhandle matroids are Ehrhart positive.
Ehrhart polynomials depend only on design parameters for certain matroids.
Abstract
We show that the base polytope of any paving matroid can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers diagrams. We calculate the Ehrhart polynomials of these matroids and consequently write down the Ehrhart polynomial of , starting with Katzman's formula for the Ehrhart polynomial of a hypersimplex. The method builds on and generalizes Ferroni's work on sparse paving matroids. Combinatorially, our construction corresponds to constructing a uniform matroid from a paving matroid by iterating the operation of stressed-hyperplane relaxation introduced by Ferroni, Nasr, and Vecchi, which generalizes the standard matroid-theoretic notion of circuit-hyperplane relaxation. We present evidence that panhandle matroids are Ehrhart positive and describe a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Graph Theory Research
