Convex and discrete geometry Polytopes and polyhedra Concept
Ehrhart polynomial
Summary
The Ehrhart polynomial of a lattice polytope counts the integer points in the dilates for positive integers . Ehrhart's theorem says that this count is a polynomial in of degree . Its leading coefficient is the volume of when is full-dimensional, and its constant term is . It is a discrete analogue of volume, and it satisfies Ehrhart–Macdonald reciprocity.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 9DEG0WRDHR |
|---|---|
| URI | m2://9DEG0WRDHR |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52B20, 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.