arXiv:1304.7587 [math.CO]AbstractReferencesReviewsResources
Roots of the Ehrhart polynomial of hypersimplices
Hidefumi Ohsugi, Kazuki Shibata
Published 2013-04-29, updated 2013-08-14Version 2
The Ehrhart polynomial of the $d$-th hypersimplex $\Delta(d,n)$ of order $n$ is studied. By computational experiments and a known result for $d=2$, we conjecture that the real part of every roots of the Ehrhart polynomial of $\Delta(d,n)$ is negative and larger than $- \frac{n}{d}$ if $n \geq 2d$. In this paper, we show that the conjecture is true when $d=3$ and that every root $a$ of the Ehrhart polynomial of $\Delta(d,n)$ satisfies $-\frac{n}{d} < {\rm Re} (a) < 1$ if $4 \leq d \ll n$.
Related articles: Most relevant | Search more
arXiv:math/0409337 [math.CO] (Published 2004-09-20)
Ehrhart polynomials of cyclic polytopes
arXiv:math/0009230 [math.CO] (Published 2000-09-26)
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
A new result on the problem of Buratti, Horak and Rosa