Interlacing Ehrhart polynomials of reflexive polytopes (Q2412570): Difference between revisions

A well-known construction allows one to associate to each finite graph \(G\) a lattice polytope (viz., the symmetric edge polytope), whose Ehrhart polynomial is denoted by \(H_G\). The authors show that all roots of \(H_G\) have a real part equal to \(-\frac{1}{2}\) if \(G\) is a complete graph, a bipartite graph of type \((2,n)\) or a complete bipartite graph of type \((3,n)\). The same property holds for the Ehrhart polynomials associated to classical root polytopes of type \(C\) and to dual Stasheff polytopes. The proofs heavily depend on the theory of interlacing polynomials, for which the authors of the paper under review refer to a manuscript of \textit{S. Fisk} [``Polynomials, roots, and interlacing'', Preprint, \url{arXiv:math/0612833}]. Each proof starts by determining \(H_G\) for the family of graphs studied. When it is too difficult to write down explicitly the Ehrhart polynomial, it is sufficient to extract a recursive formula for the Hilbert series, which is then used to establish the interlacing property. The paper ends with the following remark: ``We believe that further nice results will be obtained in future for the associahedra and duals of graphs polytopes.''