$h^{\ast }$-vectors of graph polytopes using activities of dissecting spanning trees

Abstract

Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^{\ast }$-polynomials have interesting properties and generalize important graph polynomials. For both classes of polytopes there are large, natural classes of dissections into unimodular simplices. These are such that the simplices correspond to certain spanning trees. We show that for any ``spanning tree dissection'' of the symmetric edge polytope of a graph, or the root polytope of a semi-balanced digraph, the $h^{\ast }$-polynomial of the polytope can be computed as a generating function of certain activities of the corresponding spanning trees. Apart from giving simple and flexible algorithms for computing these polynomials, our results also reveal that all dissections in question are surprisingly similar to each other: It turns out that the distributions of many statistics of spanning tree dissections are in fact independent of the actual dissection.

arXiv comment15 pages, restructured introduction

References in corpus (7)

• Arithmetic aspects of symmetric edge polytopes
• Roots of Ehrhart polynomials arising from graphs
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• Many faces of symmetric edge polytopes
• The $h^{\ast }$-polynomials of locally anti-blocking lattice polytopes and their $\gamma$-positivity
• Root polytopes and Jaeger-type dissections for directed graphs
• Ehrhart theory of symmetric edge polytopes via ribbon structures

Cited by in corpus (1)

• A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids