The Ehrhart polynomial reference article from the English Wikipedia on 24-Jul-2004
(provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

Ehrhart polynomial

Sponsorship the way you would do it
In mathematics, integral polytopes have associated Ehrhart polynomials which encode some geometrical information about them.

Specifically, consider a lattice L in Euclidean space Rn and an n-dimensional polytope P in Rn, and assume that all vertices of the polytope are points of the lattice. (A common example is L = Zn 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 a0,...,an such that:

L(P, t) = antn + an-1tn-1 + ... + a0     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 case n=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.

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

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

References