Convex and discrete geometry Polytopes and polyhedra Concept
Lattice polytope
Summary
A lattice polytope, also called an integral polytope, is a convex polytope whose vertices all have integer coordinates. Counting the integer points in such a polytope and in its dilates leads to the Ehrhart polynomial. Lattice polytopes link convex geometry with combinatorics, with integer programming and, through their normal fans, with toric varieties.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | F39N9NBFPZ |
|---|---|
| URI | m2://F39N9NBFPZ |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52B20, 11P21 |
| Specializes | Convex polytope |
| 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.