Roots of Ehrhart polynomials arising from graphs

From MaRDI portal
Publication:644696

DOI10.1007/S10801-011-0290-8zbMATH Open1229.05122arXiv1003.5444OpenAlexW3100125890MaRDI QIDQ644696FDOQ644696


Authors: Tetsushi Matsui, Akihiro Higashitani, Yuuki Nagazawa, Hidefumi Ohsugi, Takayuki Hibi Edit this on Wikidata


Publication date: 7 November 2011

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {it et al.} that all roots alpha of Ehrhart polynomials of polytopes of dimension D satisfy DleRe(alpha)leD1, but also reveals some interesting phenomena for each type of polytope. Here we present two new conjectures: (1) the roots of the Ehrhart polynomial of an edge polytope for a complete multipartite graph of order d lie in the circle |z+fracd4|lefracd4 or are negative integers, and (2) a Gorenstein Fano polytope of dimension D has the roots of its Ehrhart polynomial in the narrower strip fracD2leqRe(alpha)leqfracD21. Some rigorous results to support them are obtained as well as for the original conjecture. The root distribution of Ehrhart polynomials of each type of polytope is plotted in figures.


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




Recommendations




Cites Work


Cited In (30)

Uses Software





This page was built for publication: Roots of Ehrhart polynomials arising from graphs

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