Ehrhart polynomial

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number of integer points the polytope contains. The theory of Ehrhart polynomials can be seen as a higher-dimensional generalization of Pick's theorem in the Euclidean plane.

These polynomials are named after Eugène Ehrhart who studied them in the 1960s.

Definition[edit]

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 L in Euclidean space Rn and a d-dimensional polytope P in Rn with the property that all vertices of the polytope are points of the lattice. (A common example is L = Zn 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) = \#(tP \cap L)\,

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 a0,...,ad such that:

L(P, t) = a_d t^d + a_{d-1} t^{d-1} + ... + a_0

for all positive integers t.

The Ehrhart polynomial of the interior of a closed convex polytope P can be computed as:

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

where d is the dimension of P. This result is known as Ehrhart-Macdonald reciprocity.[1]

This is the second dilate, t = 2, of a unit square. It has nine integer points.

Examples of Ehrhart Polynomials[edit]

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 = \{x\in\mathbb{Q}^d : 0 \le x_i \le 1; 1 \le i \le d\} .

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 L(P,t) = (t + 1)d.[2][3] Additionally, if we evaluate L(P, t) at negative integers, then

L(P, -t) = (-1)^d (t - 1)^d = (-1)^d L(\text{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)/6.[4]

Ehrhart Quasi-Polynomials[edit]

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

P = \{ x\in\mathbb{Q}^d : Ax \le b\},

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

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

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

 L(\text{int}(P), t) = (-1)^n L(P, -t).

Examples of Ehrhart Quasi-Polynomials[edit]

Let P be a polygon with vertices (0,0), (0,2), (1,1) and (0,3/2). The number of integer points in tP will be counted by the quasi-polynomial [5]

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

Interpretation of coefficients[edit]

If P is closed (i.e. the boundary faces belong to P), some of the coefficients of L(P, t) have an easy interpretation:

  • the leading coefficient, ad, 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, ad−1, 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 a0 is the Euler characteristic of P. When P is a closed convex polytope, a0 = 1.

Ehrhart Series[edit]

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

 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_i^\ast ,  0 \le j \le n , such that the Ehrhart series of P is

 Ehr_P(z) = \frac{\sum_{j=0}^d h_j^\ast z^j}{(1 - z)^{n + 1}},

with  \sum_{j=0}^d h_j^\ast \neq 0 . Additionally, Stanley's non-negativity theorem states that under the given hypotheses,  h_i^\ast will be non-negative integers, for  0 \le j \le n.

Another result by Stanley shows that if P is a lattice polytope contained in Q, then h*i(P)≤h*i(Q) for all i.

The h*-vector is in general not unimodal, but it is whenever it is symmetric, and the polytope has a regular unimodal triangulation.[6]

Toric Variety[edit]

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.[7] Furthermore, some authors have pursued the question of how these polynomials could be classified.[8]

Generalizations[edit]

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.[9]

Counting the number of integer points in semi-dilations of polytopes has applications [10] 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.

See also[edit]

Notes[edit]

  1. ^ Macdonald, Ian G (1971). "Polynomials Associated with Finite Cell-Complexes". Journal of the London Mathematical Society 2 (1): 181–192. 
  2. ^ De Loera, Rambau & Santos (2010)
  3. ^ Mathar (2010)
  4. ^ Beck et al. (Stanley).
  5. ^ Beck, Matthias; Robins, Sinai (2007). Computing the Continuous Discretely. New York: Springer. pp. 46–47. 
  6. ^ Athanasiadis, Christos A. (2004). "h∗-Vectors, Eulerian Polynomials and Stable Polytopes of Graphs". Electronic Journal of Combinatorics 11 (2). 
  7. ^ Braun, Benjamin; Develin, Mike (2008). "Ehrhart Polynomial Roots and Stanley's Non-Negativity Theorem". American Mathematical Society. Contemporary Mathematics 452: 67–78. doi:10.1090/conm/452/08773. 
  8. ^ Higashitani, Akihiro (2012). "Classification of Ehrhart Polynomials of Integral Simplices". DMTCS Proceedings: 587–594. 
  9. ^ Beck, Matthias (January 2002). "Multidimensional Ehrhart reciprocity". Journal of Combinatorial Theory. Series A 97 (1): 187–194. doi:10.1006/jcta.2001.3220. 
  10. ^ Lisonek, Petr (2007). "Combinatorial Families Enumerated by Quasi-polynomials". Journal of Combinatorial Theory. Series A 114 (4): 619–630. doi:10.1016/j.jcta.2006.06.013. 

References[edit]

  • Beck, M.; De Loera, J. A.; Develin, M.; Pfeifle, J.; Stanley, R. P. (2005), "Coefficients and roots of Ehrhart polynomials", Integer points in polyhedra—geometry, number theory, algebra, optimization, Contemp. Math. 374, Providence, RI: Amer. Math. Soc., pp. 15–36, MR 2134759 .
  • Beck, Matthias; Robins, Sinai (2007), Computing the Continuous Discretely, Integer-point enumeration in polyhedra, Undergraduate Texts in Mathematics, New York: Springer-Verlag, ISBN 978-0-387-29139-0, MR 2271992 .
  • De Loera, Jesús A.; Rambau, Jörg; Santos, Francisco (2010), "9.3.3 Ehrhart polynomials and unimodular triangulations", Triangulations: Structures for Algorithms and Applications, Algorithms and Computation in Mathematics 25, Springer, p. 475, ISBN 978-3-642-12970-4 .
  • Diaz, Ricardo; Robins, Sinai (1996), The Ehrhart polynomial of a lattice n-simplex, Electronic Research Announcements of the American Mathematical Society 2: 1–6, doi:10.1090/S1079-6762-96-00001-7 . Introduces the Fourier analysis approach and gives references to other related articles.
  • Ehrhart, Eugène (1962), Sur les polyèdres rationnels homothétiques à n dimensions, C. R. Acad. Sci. Paris 254: 616–618 . Definition and first properties.
  • Mathar, Richard J. (2010). "Point counts of Dk and some Ak and Ek integer lattices inside hypercubes". arXiv:1002.3844.
  • Mustaţă, Mircea (February 2005), "Chapter 13: Ehrhart polynomials", Lecture notes on toric varieties .