Convex and discrete geometry Definition
Ehrhart polynomial
Builds on Lattice polytopePolynomial function
Definition
Let be a lattice polytope of dimension . For each integer , let be the number of integer points in the dilate . By Ehrhart's theorem, there is a unique polynomial with rational coefficients such that for all integers . This polynomial is the Ehrhart polynomial of .
Remarks
The polynomial has degree , and . If , the leading coefficient of is the volume of . In general the leading coefficient is the volume of measured inside its affine hull, normalised by the lattice of integer points of that affine hull.
Example: for the unit square , the dilate contains integer points, so . For the triangle with vertices , , , the dilate contains the points with and , so . In both cases the leading coefficient is the area, and .
Non-example: the segment is a rational polytope but not a lattice polytope. Here , which is not a polynomial in ; it is only a quasi-polynomial of period . So the hypothesis that the vertices are integer points is needed.
The generating function is a rational function of the form , where is a polynomial with nonnegative integer coefficients.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Lattice polytope concept
- Polynomial function concept
- Ehrhart polynomial definition
Further reading
About this page
| Tag | QGPHXKCNNX |
|---|---|
| URI | m2://QGPHXKCNNX |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52B20, 11P21, 05A15 |
| Defines | Ehrhart polynomial |
| Uses | Lattice polytope, Polynomial function |
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
No page links to this page yet.