Math 2.0

Convex and discrete geometry Polytopes and polyhedra Concept

Ehrhart polynomial

Summary

The Ehrhart polynomial of a lattice polytope PP counts the integer points in the dilates tPtP for positive integers tt. Ehrhart's theorem says that this count is a polynomial in tt of degree dim⁡P\dim P. Its leading coefficient is the volume of PP when PP is full-dimensional, and its constant term is 11. It is a discrete analogue of volume, and it satisfies Ehrhart–Macdonald reciprocity.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ehrhart_polynomial
About this page
Tag9DEG0WRDHR
URIm2://9DEG0WRDHR
Kindconcept
WritingW0 stub
MSC52B20, 11P21, 05A15
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions

Results about this

Used by