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:
“Every man has to learn the points of the compass again as often as he awakes, whether from sleep or any abstraction.”
—Henry David Thoreau (1817–1862)
“bars of that strange speech
In which each sound sets out to seek each other,
Murders its own father, marries its own mother,
And ends as one grand transcendental vowel.”
—Randall Jarrell (1914–1965)