Lattice Points in Convex Sets
Minkowski's theorem relates the number d(Λ) and the volume of a symmetric convex set S to the number of lattice points contained in S. The number of lattice points contained in a polytope all of whose vertices are elements of the lattice is described by the polytope's Ehrhart polynomial. Formulas for some of the coefficients of this polynomial involve d(Λ) as well.
- See also: Integer points in polyhedra
Read more about this topic: Lattice Points
Famous quotes containing the words points and/or sets:
“It’s my feeling that God lends you your children until they’re about eighteen years old. If you haven’t made your points with them by then, it’s too late.”
—Betty Ford (b. 1918)
“This is certainly not the place for a discourse about what festivals are for. Discussions on this theme were plentiful during that phase of preparation and on the whole were fruitless. My experience is that discussion is fruitless. What sets forth and demonstrates is the sight of events in action, is living through these events and understanding them.”
—Doris Lessing (b. 1919)