Ehrhart theory of paving and panhandle matroids

DOI10.1515/ADVGEOM-2023-0020zbMATH Open1526.05028arXiv2201.12442OpenAlexW4387642439MaRDI QIDQ6060892FDOQ6060892

Authors: Derek Hanely, Jeremy L. Martin, Daniel McGinnis, Dane Miyata, George D. Nasr, Andrés R. Vindas Meléndez, Mei Yin 

Publication date: 6 November 2023

Published in: advg (Search for Journal in Brave)

Abstract: We show that the base polytope $P_M$ of any paving matroid $M$ can be obtained from a hypersimplex by slicing off subpolytopes. The pieces removed are base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers diagrams, whose Ehrhart polynomials we can calculate explicitly. Consequently, we can write down the Ehrhart polynomial of $P_M$, 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 conjectured combinatorial formula involving chain gangs and Eulerian numbers from which Ehrhart positivity of panhandle matroids will follow. As an application of the main result, we calculate the Ehrhart polynomials of matroids associated with Steiner systems and finite projective planes, and show that they depend only on their design-theoretic parameters: for example, while projective planes of the same order need not have isomorphic matroids, their base polytopes must be Ehrhart equivalent.

Full work available at URL: https://arxiv.org/abs/2201.12442

zbMATH Keywords

matroidpositivityrelaxationSteiner systemprojective planeEhrhart theorybase polytopepaving matroid

Mathematics Subject Classification ID

Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on Polytopes
• Computing the Continuous Discretely
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Submodular functions and optimization.
• Title not available (Why is that?)
• Positroid varieties: juggling and geometry
• Splitting Polytopes
• Permutohedra, Associahedra, and Beyond
• Convex Polytopes
• Matroid polytopes, nested sets and Bergman fans
• Faces of generalized permutohedra
• Matroid polytopes and their volumes
• Title not available (Why is that?)
• On the asymptotic proportion of connected matroids
• Combinatorial geometries, convex polyhedra, and Schubert cells
• Positroids and Schubert matroids
• On the number of matroids compared to the number of sparse paving matroids
• Lattice path matroids: Enumerative aspects and Tutte polynomials
• Title not available (Why is that?)
• Ehrhart polynomials of matroid polytopes and polymatroids
• THE HILBERT SERIES OF ALGEBRAS OF THE VERONESE TYPE
• Title not available (Why is that?)
• Flag enumerations of matroid base polytopes
• On lattice path matroid polytopes: integer points and Ehrhart polynomial
• Berline-Vergne valuation and generalized permutohedra
• Matroids from hypersimplex splits
• On the Ehrhart polynomial of minimal matroids
• Hypersimplices are Ehrhart positive
• Matroids are not Ehrhart positive
• Ehrhart polynomials of rank two matroids

Cited In (2)

• On the Ehrhart polynomial of Schubert matroids
• Valuative invariants for large classes of matroids

This page was built for publication: Ehrhart theory of paving and panhandle matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060892)