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 applies to a larger family of polynomials.
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 that the Ehrhart polynomials of $C_d^*$ for $d=1,2,\cdots$ has the interlacing property.
An outstanding conjecture on roots of Ehrhart polynomials says that all roots $α$ of the Ehrhart polynomial of an integral convex polytope of dimension $d$ satisfy $-d \leq \Re(α) \leq d-1$. In this paper, we suggest some counterexamples of this conjecture.
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 also investigate the roots of Ehrhart polynomials. We prove that for fixed d, there exists a bounded region of C containing all roots of Ehrhart polynomials of d-polytopes, and that all real roots of these polynomials lie in [-d, [d/2]). In contrast, we prove that when the dimension d is not fixed the positive real roots can be arbitrarily large. We finish …
The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. \cite[Conjecture 4.10]{MHNOH}, says that all roots $α$ of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension $d$ satisfy $-\frac{d}{2} \leq \Re(α) \leq \frac{d}{2} -1$. In this paper, we observe the behaviors of roots of SSNN polynomials which are a wider class of the polynomials containing all the Ehrhart polynomials of Gorenstein Fano polytopes. As a result, we verify that this conjecture is true when the roots are real numbers or when $d \leq 5$.
The Ehrhart polynomial of the $d$-th hypersimplex $Δ(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 $Δ(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 $Δ(d,n)$ satisfies $-\frac{n}{d} < {\rm Re} (a) < 1$ if $4 \leq d \ll n$.
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 explicitly. We also present examples which demonstrate that this result cannot be extended to dimension six.
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 $α$ of Ehrhart polynomials of polytopes of dimension $D$ satisfy $-D \le \Re(α) \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 int…
Given arbitrary integers $k$ and $d$ with $0 \leq 2k \leq d$, we construct a Gorenstein Fano polytope $\Pc \subset \RR^d$ of dimension $d$ such that (i) its Ehrhart polynomial $i(\Pc, n)$ possesses $d$ distinct roots; (ii) $i(\Pc, n)$ possesses exactly $2k$ imaginary roots; (iii) $i(\Pc, n)$ possesses exactly $d - 2k$ real roots; (iv) the real part of each of the imaginary roots is equal to $- 1 / 2$; (v) all of the real roots belong to the open interval $(-1, 0)$.
Stanley's non-negativity theorem is at the heart of many of the results in Ehrhart theory. In this paper, we analyze the root behavior of general polynomials satisfying the conditions of Stanley's theorem and compare this to the known root behavior of Ehrhart polynomials. We provide a possible counterexample to a conjecture of the second author, M. Beck, J. De Loera, J. Pfeifle, and R. Stanley, and contribute some experimental data as well.
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 dimension. As a result, we have a smooth Fano polytope that is a counterexample to the two conjectures on the roots of Ehrhart polynomials.
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart polynomials of lattice polytopes, which we termed the symmetric and truncated Ehrhart-like polynomials. We conjectured that these polynomials have nonnegative integer coefficients. Here we affirm "half" of this positivity conjecture by providing a positive, combinatorial formula for the coefficients of the symmetric Ehrhart-like polynomials. This formula depends …
In this paper, we study the root distributions of Ehrhart polynomials of free sums of certain reflexive polytopes. We investigate cases where the roots of the Ehrhart polynomials of the free sums of $A_d^\vee$'s or $A_d$'s lie on the canonical line $\mathrm{Re}(z)=-\frac{1}{2}$ on the complex plane $\mathbb{C}$, where $A_d$ denotes the root polytope of type A of dimension $d$ and $A_d^\vee$ denotes its polar dual. For example, it is proved that $A_m^\vee \oplus A_n^\vee$ with $\min\{m,n\} \leq 1$ or $m+n \leq 7$, $A_2^\vee \oplus (A_1^\vee)^{\oplus n}$ and $A_3^\vee \oplus (A_1^\vee)^{\oplus n…
We study a class of polynomials that has all of its roots on the critical line and shares many properties with Ehrhart polynomials. Braun showed that the roots of Ehrhart polynomials are bounded quadratically and Higashitani provided examples for polytopes whose Ehrhart polynomial roots come close to this bound. In the case of polytopes which have their roots on the critical line, we present an improved bound. As a side effect this confirms a special case of a conjecture of Braun.
We provide a formula for the Ehrhart polynomial of the connected matroid of size $n$ and rank $k$ with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $h^*$-real-rooted (and hence unimodal). We prove that the operation of circuit-hyperplane relaxation relates minimal matroids and matroid polytopes subdivisions, and also preserves Ehrhart positivity. We state two conjectures: that indeed all matroids are $h^*$-real-rooted, and that the coefficients of the Ehrhart polynomial of a connected matroid of fixed rank and cardinality ar…
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 dimension. This improves on the previously best known bound n and complements a recent result of Braun where it is shown that the norm of a root of an Ehrhart polynomial is at most of order n^2. For the class of 0-symmetric lattice polytopes we present a conjecture on the smallest volume for a given number of interior lattice points and prove the conjecture for cr…
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, approximately, as $d$ grows, by variation of argument of the generating function $\sum_{m\geq 0}\mathcal{L}_{d}(m)t^{m+x-1}=(1+t)^{d}(1-t)^{-d-1}t^{x-1}$, as $t$ varies appropriately on the segment of the imaginary line contained inside the unit disk.
As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side length two. We discuss several counterexamples to this conjecture and, on the positive side, we identify a family of lattice polytopes that fulfill the claimed inequalities. This family is related to the recently introduced class of $l$-reflexive polytopes.
Recent work has focused on the roots z of the Ehrhart polynomial of a lattice polytope P. The case when Re(z) = -1/2 is of particular interest: these polytopes satisfy Golyshev's "canonical line hypothesis". We characterise such polytopes when dim(P) <= 7. We also consider the "half-strip condition", where all roots z satisfy -dim(P)/2 <= Re(z) <= dim(P)/2-1, and show that this holds for any reflexive polytope with dim(P) <= 5. We give an example of a 10-dimensional reflexive polytope which violates the half-strip condition, thus improving on an example by Ohsugi--Shibata in dimension 34.
Over a decade ago De Loera, Haws and Köppe conjectured that Ehrhart polynomials of matroid polytopes have only positive coefficients and that the coefficients of the corresponding $h^*$-polynomials form a unimodal sequence. The first of these intensively studied conjectures has recently been disproved by the first author who gave counterexamples in all ranks greater or equal to three. In this article we complete the picture by showing that Ehrhart polynomials of matroids of lower rank have indeed only positive coefficients. Moreover, we show that they are coefficient-wise bounded by the Ehrhar…
We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related by their geometric and arithmetic mean. We also show that the roots of lattice $n$-polytopes with or without interior lattice points differ essentially. Furthermore, we study the structure of the roots in the planar case. Here it turns out that their distribution reflects basic properties of lattice polygons.
A complete classification of the $δ$-vectors of lattice polytopes whose normalized volumes are at most $4$ is known. In the present paper, we will classify all the $δ$-vectors of lattice polytopes with normalized volumes $5$.
University of Kentucky(肯塔基大学);Pomona College(波莫纳学院);Washington University in St. Louis(华盛顿大学圣路易斯分校);University of California, Davis(加州大学戴维斯分校);Harvey Mudd College(哈维穆德学院)
A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have the same real part. In relation to this conjecture, Yoshinaga obtained an explicit relationship between the characteristic quasi-polynomial and the Ehrhart quasi-polynomial for the fundamental alcove. In this paper, we calculate Yoshinaga's explicit formula through the decomposition of the Ehrhart quasi-polynomial into several quasi-polynomials and a modifie…
For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $δ(\Pc)=(δ_0, δ_1,..., δ_d)$ the $δ$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^dδ_i$ its normalized volume. In this paper, we will establish the new equalities and inequalities on $δ$-vectors for integral simplices whose normalized volumes are prime. Moreover, by using those, we will classify all the possible $δ$-vectors of integral simplices with normalized volume 5 and 7.
The Lidskii formula for the type $A_n$ root system expresses the volume and Ehrhart polynomial of the flow polytope of the complete graph with nonnegative integer netflows in terms of Kostant partition functions. For every integer polytope the volume is the leading coefficient of the Ehrhart polynomial. The beauty of the Lidskii formula is the revelation that for these polytopes its Ehrhart polynomial function can be deduced from its volume function! Baldoni and Vergne generalized Lidskii's result for flow polytopes of arbitrary graphs $G$ and nonnegative integer netflows. While their formulas…
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope still has the property that each coefficient is the normalized volume of a projection of the original polytope. Furthermore, we show that the new family of lattice-face polytopes contains all possible combinatorial types of rational polytopes.
We describe an algorithm for the computation of generalized (or weighted) Ehrhart series based on Stanley decompositions as implemented in the offspring NmzIntegrate of Normaliz. The algorithmic approach includes elementary proofs of the basic results. we illustrate the computations by examples from combinatorial voting theory.
For every positive integer $n$, consider the linear operator $\U_{n}$ on polynomials of degree at most $d$ with integer coefficients defined as follows: if we write $\frac{h(t)}{(1 - t)^{d + 1}} = \sum_{m \geq 0} g(m) t^{m}$, for some polynomial $g(m)$ with rational coefficients, then $\frac{\U_{n}h(t)}{(1- t)^{d + 1}} = \sum_{m \geq 0} g(nm) t^{m}$. We show that there exists a positive integer $n_{d}$, depending only on $d$, such that if $h(t)$ is a polynomial of degree at most $d$ with nonnegative integer coefficients and $h(0) \geq 1$, then for $n \geq n_{d}$, $\U_{n}h(t)$ has simple, real,…
The Eulerian polynomials and derangement polynomials are two well-studied generating functions that frequently arise in combinatorics, algebra, and geometry. When one makes an appearance, the other often does so as well, and their corresponding generalizations are similarly linked. This is this case in the theory of subdivisions of simplicial complexes, where the Eulerian polynomial is an $h$-polynomial and the derangement polynomial is its local $h$-polynomial. Separately, in Ehrhart theory the Eulerian polynomials are generalized by the $h^\ast$-polynomials of $s$-lecture hall simplices. Her…
It is known that the normalized volume of standard hypersimplices (defined as some slices of the unit hypercube) are the Eulerian numbers. More generally, a recent conjecture of Stanley relates the Ehrhart series of hypersimplices with descents and excedences in permutations. This conjecture was proved by Nan Li, who also gave a generalization to colored permutations. In this article, we give another generalization to colored permutations, using the flag statistics introduced by Foata and Han. We obtain in particular a new proof of Stanley's conjecture, and some combinatorial identities relati…
For an $n$-dimensional lattice simplex $Δ_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for $Δ_{(1,\mathbf{q})}$ factors as a product of geometric series in powers of $z$. Our motivation is a theorem of Rodriguez-Villegas implying that when the $h^*$-polynomial of a lattice polytope $P$ has all roots on the unit circle, then the Ehrhart polynomial of $P$ has positive coefficients. We focus on those $Δ_{(1,\mathbf{q})}$ for which $\mathbf{q}$ has only two or three di…
Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and asked about their geometric realizations. We show that a family of subword complexes can be realized geometrically via regular triangulations of root polytopes. This implies that a family of $β$-Grothendieck polynomials are special cases of reduced forms in the subdivision algebra of root polytopes. We can also write the volume and Ehrhart series of root polyto…
For lattice polytopes $P_1,\ldots, P_k \subseteq \mathbb{R}^d$, Bihan (2014) introduced the discrete mixed volume $\mathrm{DMV}(P_1,\dots,P_k)$ in analogy to the classical mixed volume. In this note we initiate the study of the associated mixed Ehrhart polynomial $\mathrm{ME}_{P_1,\dots,P_k}(n) = \mathrm{DMV}(nP_1,\dots,nP_k)$. We study properties of this polynomial and we give interpretations for some of its coefficients in terms of (discrete) mixed volumes. Bihan (2014) showed that the discrete mixed volume is always non-negative. Our investigations yield simpler proofs for certain special c…
We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector fields in the real plane, and at each point in the plane analyze the combinatorics of the Gale dual vector configuration. This approach permits us to incorporate arbitrary linear equations and inequalities among the coefficients in a unified manner to obtain more precise bounds on the location of roots. We apply our technique to bound the location of roots of …
In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of the polytope and it depends heavily on the value $d$ and its divisors, where $d=\sqrt{\frac{a^2+b^2+c^2}{3}}$ and $(a,b,c)$ ($\gcd(a,b,c)=1$) is a vector with integer coordinates normal to the plane containing the triangle.
Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is equivalent to the h-vector of any triangulation of Q. It follows that the interior polynomials of (V,E) and its transpose (E,V) agree. When G is a complete bipartite graph, our result recovers a well known hypergeometric identity due to Saalschütz. It also implies that certain extremal coefficients in the Homfly polynomial of a special alternating link can be read of…
The Ehrhart polynomial of a lattice polytope $P$ encodes information about the number of integer lattice points in positive integral dilates of $P$. The $h^\ast$-polynomial of $P$ is the numerator polynomial of the generating function of its Ehrhart polynomial. A zonotope is any projection of a higher dimensional cube. We give a combinatorial description of the $h^\ast$-polynomial of a lattice zonotope in terms of refined descent statistics of permutations and prove that the $h^\ast$-polynomial of every lattice zonotope has only real roots and therefore unimodal coefficients. Furthermore, we p…
We study real sequences $\{a_{n}\}_{n\in \mathbb{N}}$ that eventually agree with a polynomial. We show that if the numerator polynomial of its rational generating series is of degree $s$ and has only nonnegative coefficients, then the numerator polynomial of the subsequence $\{ a_{rn+i}\}_{n\in \mathbb{N}}$, $0\leq i<r$, has only nonpositive, real roots for all $r\geq s-i$. We apply our results to combinatorially positive valuations on polytopes and to Hilbert functions of Veronese submodules of graded Cohen-Macaulay algebras. In particular, we prove that the Ehrhart $h^\ast$-polynomial of the…
School of Mathematics, Cardiff University(卡迪夫大学数学学院);Departamento de Matemáticas, Pontificia Universidad Católica de Chile(智利天主教大学数学系);Department of Mathematics and Computer Science, Saint Mary’s College of California(加州圣玛丽学院数学与计算机科学系);Department of Mathematics and Statistics, Villanova University(维拉诺瓦大学数学与统计学系);Department of Mathematics, University of California Santa Cruz(加州大学圣克鲁兹分校数学系);Department of Mathematical Sciences, University of Wisconsin Milwaukee(威斯康星大学密尔沃基分校数学科学系);Department of Mathematics, Central College(中央学院数学系)
A root system in which all roots have same norm is known as a simply laced root system. We present a simple method of classifying all simply laced root systems.