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:
“Type of the wise, who soar, but never roam—
True to the kindred points of Heaven and Home!”
—William Wordsworth (1770–1850)
“In the beautiful, man sets himself up as the standard of perfection; in select cases he worships himself in it.... Man believes that the world itself is filled with beauty—he forgets that it is he who has created it. He alone has bestowed beauty upon the world—alas! only a very human, an all too human, beauty.”
—Friedrich Nietzsche (1844–1900)