Ehrhart polynomial

From Wikipedia, the free encyclopedia

In mathematics, integral polytopes have associated Ehrhart polynomials which encode relations between the volume of a polytope, number of integer points the polytope contains, and other related geometric quantities. The theory of Ehrhart polynomials can be seen as a higher dimensional generalization of Pick's theorem in the Euclidean plane.

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 1962 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 leading coefficient, an, 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, an−1, can be computed as follows: the lattice L induces a lattice LF on any face F of P; take the (n−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.

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 convex polytope P can be computed as:

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

  • E. Ehrhart: Sur les polyèdres rationnels homothétiques à n dimensions, C. R. Acad. Sci. Paris 254 (1962), pp. 616–618. 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.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.