Related papers: Roots of Ehrhart polynomials of Gorenstein Fano po…
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…
The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. \cite[Conjecture 4.10]{MHNOH}, says that all roots $\alpha$ of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension $d$ satisfy $-\frac{d}{2} \leq…
V. Golyshev conjectured that for any smooth polytope P of dimension at most five, the roots $z\in\C$ of the Ehrhart polynomial for P have real part equal to -1/2. An elementary proof is given, and in each dimension the roots are described…
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)$…
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…
In this paper, we study the Ehrhart polynomial of the dual of the root polytope of type C of dimension $d$, denoted by $C_d^*$. We prove that the roots of the Ehrhart polynomial of $C_d^*$ have the same real part $-1/2$, and we also prove…
The symmetric edge polytopes of odd cycles (del Pezzo polytopes) are known as smooth Fano polytopes. In this paper, we show that if the length of the cycle is 127, then the Ehrhart polynomial has a root whose real part is greater than the…
It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.…
A polynomial $f(x)$ of degree $d$ is said to be magic positive if all the coefficients are non-negative when $f(x)$ is expanded with respect to the basis $\{x^i(x+1)^{d-i}\}_{i=0}^d$. It is known that if $f(x)$ is magic positive, then the…
It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.
An outstanding conjecture on roots of Ehrhart polynomials says that all roots $\alpha$ of the Ehrhart polynomial of an integral convex polytope of dimension $d$ satisfy $-d \leq \Re(\alpha) \leq d-1$. In this paper, we suggest some…
It is known that every integral convex polytope is unimodularly equivalent to a face of some Gorenstein Fano polytope. It is then reasonable to ask whether every normal polytope is unimodularly equivalent to a face of some normal Gorenstein…
M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…
Q-factorial Gorenstein toric Fano varieties X of dimension d with Picard number rho(X) correspond to simplicial reflexive d-polytopes with rho(X)+d vertices. Casagrande showed that any simplicial reflexive d-polytope has at most 3d…
We propose a refined but natural notion of toric degenerations that respect a given embedding and show that within this framework a Gorenstein Fano variety can only be degenerated to a Gorenstein Fano toric variety if it is embedded via its…
We use the method of steepest descents to study the root distribution of the Ehrhart polynomial of the $d$-dimensional cross-polytope, namely $\mathcal{L}_{d}$, as $d\rightarrow \infty$. We prove that the distribution function of the roots,…
Our probabilistic analysis sheds light to the following questions: Why do random polynomials seem to have few, and well separated real roots, on the average? Why do exact algorithms for real root isolation may perform comparatively well or…
Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the…
If $P$ is a lattice polytope (i.e., $P$ is the convex hull of finitely many integer points in $\mathbb{R}^d$) of dimension $d$, Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|nP \cap \mathbb{Z}^d|$ is a…