Roots of Ehrhart polynomials arising from graphs

Details Roots of Ehrhart polynomials arising from graphs Roots of Ehrhart polynomials arising from graphs

2010-03-29

arxiv.org/abs/1003.5444v2

Journal of Algebraic Combinatorics 34(4) 721-749 (2011)

Mathematics

Combinatorics

Scientific paper

10.1007/s10801-011-0290-8

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 $-D \le \Re(\alpha) \le D - 1$, 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+\tfrac{d}{4}| \le \tfrac{d}{4}$ or are negative integers, and (2) a Gorenstein Fano polytope of dimension $D$ has the roots of its Ehrhart polynomial in the narrower strip $-\tfrac{D}{2} \leq \Re(\alpha) \leq \tfrac{D}{2}-1$. 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.

Affiliated with

Also associated with

No associations

Rating

Roots of Ehrhart polynomials arising from graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Roots of Ehrhart polynomials arising from graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Roots of Ehrhart polynomials arising from graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499405