Ehrhart polynomial

Definition

Informally, if P is a polytope, and tP is the polytope formed by expanding P by a factor of t in each dimension, then L(P, t) is the number of integer lattice points in tP.

More formally, consider a lattice \mathcal{L} in Euclidean space \R^n and a d-dimensional polytope P in \R^n with the property that all vertices of the polytope are points of the lattice. (A common example is \mathcal{L} = \Z^n and a polytope for which all vertices have integer coordinates.) For any positive integer t, let tP be the t-fold dilation of P (the polytope formed by multiplying each vertex coordinate, in a basis for the lattice, by a factor of t), and let

:L(P,t) = #\left(tP \cap \mathcal{L}\right)

be the number of lattice points contained in the polytope tP. Ehrhart showed in 1962 that L is a rational polynomial of degree d in t, i.e. there exist rational numbers L_0(P),\dots,L_d(P) such that:

:L(P, t) = L_d(P) t^d + L_{d-1}(P) t^{d-1} + \cdots + L_0(P)

for all positive integers t.{{citation

Reciprocity property

The Ehrhart polynomial of the interior of an integral polytope P can be computed as:

: L(\operatorname{int}(P), t) = (-1)^d L(P, -t),

where d is the dimension of P. This result is known as Ehrhart–Macdonald reciprocity.

Examples

Let P be a d-dimensional unit hypercube whose vertices are the integer lattice points all of whose coordinates are 0 or 1. In terms of inequalities,

: P = \left{x\in\R^d : 0 \le x_i \le 1; 1 \le i \le d\right}.

Then the t-fold dilation of P is a cube with side length t, containing (t + 1)d integer points. That is, the Ehrhart polynomial of the hypercube is .{{citation|title=Triangulations: Structures for Algorithms and Applications|volume=25|series=Algorithms and Computation in Mathematics|first1=Jesús A.|last1=De Loera|author1-link=Jesús A. De Loera|first2=Jörg|last2=Rambau|first3=Francisco|last3=Santos|author3-link= Francisco Santos Leal

: L(P, -t) = (-1)^d (t - 1)^d = (-1)^d L(\operatorname{int}(P), t),

as we would expect from Ehrhart–Macdonald reciprocity.

Many other figurate numbers can be expressed as Ehrhart polynomials. For instance, the square pyramidal numbers are given by the Ehrhart polynomials of a square pyramid with an integer unit square as its base and with height one; the Ehrhart polynomial in this case is (t + 1)(t + 2)(2t + 3).{{citation

Ehrhart quasi-polynomials

Let P be a rational polytope. In other words, suppose

:P = \left{ x\in\R^d : Ax \le b\right}

is bounded, where A \in \Q^{k \times d} and b \in \Q^k. (Equivalently, P is the convex hull of finitely many points in \Q^d.) Then define

:L(P, t) = #\left(\left{x\in\Z^d : Ax \le tb \right} \right).

In this case, L(P, t) is a quasi-polynomial in t. Just as with integral polytopes, Ehrhart–Macdonald reciprocity holds, that is (assuming P is d-dimensional),

: L(\operatorname{int}(P), t) = (-1)^d L(P, -t).

Examples of Ehrhart quasi-polynomials

Let P be a polygon with vertices (0,0), (0,2), (1,1) and (, 0). The number of integer points in tP will be counted by the quasi-polynomial {{citation | title-link = Computing the Continuous Discretely

: L(P, t) = \frac{7t^2}{4} + \frac{5t}{2} + \frac{7 + (-1)^t}{8}.

Interpretation of coefficients

If P is an integral polytope, some of the coefficients of L(P, t) have an easy interpretation:

• the leading coefficient, L_d(P), is equal to the d-dimensional volume of P, divided by d(L) (see lattice for an explanation of the content or covolume d(L) of a lattice);
• the second coefficient, L_{d-1}(P), can be computed as follows: the lattice L induces a lattice LF on any face F of P; take the (d − 1)-dimensional volume of F, divide by 2d(LF), and add those numbers for all faces of P;
• the constant coefficient, L_0(P), is the Euler characteristic of P. When P is a closed convex polytope, L_0(P)=1.

The Betke–Kneser theorem

Ulrich Betke and Martin Kneser established the following characterization of the Ehrhart coefficients. A functional Z defined on integral polytopes is an \operatorname{SL}(n,\Z) and translation invariant valuation if and only if there are real numbers c_0,\ldots, c_n such that

: Z= c_0 L_0+\cdots +c_n L_n.

Ehrhart series

We can define a generating function for the Ehrhart polynomial of an integral d-dimensional polytope P as

: \operatorname{Ehr}P(z) = \sum{t\ge 0} L(P, t)z^t.

This series can be expressed as a rational function. Specifically, Ehrhart proved (1962) that there exist complex numbers h_j^*, 0 \le j \le d, such that the Ehrhart series of P is

:\operatorname{Ehr}P(z) = \frac{\sum{j=0}^d h_j^\ast(P) z^j}{(1 - z)^{d + 1}}.

Richard P. Stanley's non-negativity theorem states that under the given hypotheses, each h_j^* will be a non-negative integer, for 0 \le j \le d.

Another result by Stanley shows that if P is a lattice polytope contained in Q, then h_j^(P) \le h_j^(Q) for all j. The h^*-vector is in general not unimodal, but it is whenever it is symmetric and the polytope has a regular unimodular triangulation.

Ehrhart series for rational polytopes

As in the case of polytopes with integer vertices, one defines the Ehrhart series for a rational polytope. For a d-dimensional rational polytope P, where D is the smallest integer such that DP is an integer polytope (D is called the denominator of P), then one has

:\operatorname{Ehr}P(z) = \sum{t\ge 0} L(P, t)z^t = \frac{\sum_{j=0}^{D(d+1)-1} h_j^\ast(P) z^j}{\left(1 - z^D\right)^{d + 1}},

where the h_j^* are still non-negative integers.

Non-leading coefficient bounds

The polynomial's non-leading coefficients c_0,\dots,c_{d-1} in the representation

:L(P,t) = \sum_{r=0}^d c_r t^r

can be upper bounded:

:c_r \leq |s(d,r)| c_d + \frac{1}{(d-1)!} |s(d,r+1)|

where s(n,k) is the Stirling number of the first kind. Lower bounds also exist.

Toric varieties

The case n=d=2 and t = 1 of these statements yields Pick's theorem. Formulas for the other coefficients are much harder to get; Todd classes of toric varieties, the Riemann–Roch theorem as well as Fourier analysis have been used for this purpose.

If X is the toric variety corresponding to the normal fan of P, then P defines an ample line bundle on X, and the Ehrhart polynomial of P coincides with the Hilbert polynomial of this line bundle.

Ehrhart polynomials can be studied for their own sake. For instance, one could ask questions related to the roots of an Ehrhart polynomial. Furthermore, some authors have pursued the question of how these polynomials could be classified.

Generalizations

It is possible to study the number of integer points in a polytope P if we dilate some facets of P but not others. In other words, one would like to know the number of integer points in semi-dilated polytopes. It turns out that such a counting function will be what is called a multivariate quasi-polynomial. An Ehrhart-type reciprocity theorem will also hold for such a counting function.

Counting the number of integer points in semi-dilations of polytopes has applications in enumerating the number of different dissections of regular polygons and the number of non-isomorphic unrestricted codes, a particular kind of code in the field of coding theory.

References

References

1. Ehrhart, Eugène (1967), "Démonstration de la loi de réciprocité du polyèdre rationnel", ''Comptes Rendus de l'Académie des Sciences de Paris, Sér. A-B'' 265, A91–A94.
2. Macdonald, Ian G.. (1971). "Polynomials associated with finite cell-complexes". [[Journal of the London Mathematical Society]].
3. (1985). "Zerlegungen und Bewertungen von Gitterpolytopen". [[Crelle's Journal.
4. (1993). "A monotonicity property of $h$-vectors and $h^*$-vectors". [[European Journal of Combinatorics]].
5. (2004). "''h''*-Vectors, Eulerian Polynomials and Stable Polytopes of Graphs". [[Electronic Journal of Combinatorics]].
6. Stanley, Richard P.. (1980). "Decompositions of rational convex polytopes". Annals of Discrete Mathematics.
7. (January 2007). "Irrational proofs for three theorems of Stanley". [[European Journal of Combinatorics]].
8. (1985-12-01). "Lattice points in lattice polytopes". [[Monatshefte für Mathematik]].
9. (2009-01-01). "Lower bounds on the coefficients of Ehrhart polynomials". [[European Journal of Combinatorics]].
10. (2008). "Ehrhart Polynomial Roots and Stanley's Non-Negativity Theorem". [[American Mathematical Society]].
11. Higashitani, Akihiro. (2012). "Classification of Ehrhart Polynomials of Integral Simplices". DMTCS Proceedings.
12. Beck, Matthias. (January 2002). "Multidimensional Ehrhart reciprocity". [[Journal of Combinatorial Theory]].
13. Lisonek, Petr. (2007). "Combinatorial Families Enumerated by Quasi-polynomials". [[Journal of Combinatorial Theory]].