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 (group)
Famous quotes containing the words points and/or sets:
“Type of the wise, who soar, but never roam—
True to the kindred points of Heaven and Home!”
—William Wordsworth (1770–1850)
“A continual feast of commendation is only to be obtained by merit or by wealth: many are therefore obliged to content themselves with single morsels, and recompense the infrequency of their enjoyment by excess and riot, whenever fortune sets the banquet before them.”
—Samuel Johnson (1709–1784)