Home > Ehrhart polynomial

Specifically, consider a lattice L in Euclidean space Rⁿ and an n- dimensional polytope P in Rⁿ, and assume that all vertices of the polytope are points of the lattice. (A common example is L = Zⁿ and a polytope with all its vertex coordinates being integers.) For any positive integer t, let tP be the t-fold dilation of P and let L(P, t) be the number of lattice points contained in tP. Ehrhart showed in 1967 that L is a rational polynomial of degree n in t, i.e. there exist rational numbers a₀,...,a_n such that:

L(P, t) = a_ntⁿ + a_n-1t^n-1 + ... + a₀     for all positive integers t.

Furthermore, 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, a_n, is equal to the n-dimensional volume of P, divided by d(L) (see lattice for an explanation of the content d(L) of a lattice);
• the second coefficient, a_n-1, can be computed as follows: the lattice L induces a lattice L_F on any face F of P; take the (n-1)-dimensional volume of F, divide by 2d(L_F), and add those numbers for all faces of P;
• the constant coefficient a₀ is the Euler characteristic of P.

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

The Ehrhart polynomial of the interiorIn topology, the interior of a set is the union of all open sets contained in it, and contains all interior points. It is the largest open set contained in the original set. The interior of a set S is denoted by int S Int S or, S''o. A set S is an open se of a closed polytope P can be computed as:

L(int P, t) = (-1)ⁿ L(P, −t).

References

• E. Ehrhart: Sur un problème géométrie diophantienne linéaire II, Journal Reine Angewandte Mathematik 227 (1967), pp. 25-49. Definition and first properties.
• Ricardo Diaz, Sinai Robins: The Ehrhart polynomial of a lattice n-simplex, Electronic Research Announcements of the American Mathematical Society 2 (1996), pages 1-6, online version. Introduces the Fourier analysis approach and gives references to other related articles.