Convex and discrete geometry Definition
Lattice polytope
Builds on Convex polytopeVertex of a polytopeLattice (group)
Definition
A lattice polytope in is a convex polytope all of whose vertices lie in . Equivalently, is the convex hull of a finite subset of .
Remarks
Example: the triangle with vertices , , is a lattice polygon, since all three vertices have integer coordinates.
Non-example: the triangle with vertices , , is not a lattice polygon, since the vertex is not in . It is a rational polytope: its vertices lie in .
More generally, for a lattice , a lattice polytope with respect to is a convex polytope with all vertices in . A linear change of coordinates turns into , so the case is the standard one. Two lattice polytopes are usually regarded as the same when an affine map with and carries one onto the other.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex polytope concept
- Lattice (group) concept
- Vertex of a polytope concept
- Lattice polytope definition
Further reading
About this page
| Tag | PF5HS26Q0H |
|---|---|
| URI | m2://PF5HS26Q0H |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52B20, 11P21 |
| Defines | Lattice polytope |
| Uses | Convex polytope, Vertex of a polytope, Lattice (group) |
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.