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:
“When our relatives are at home, we have to think of all their good points or it would be impossible to endure them. But when they are away, we console ourselves for their absence by dwelling on their vices.”
—George Bernard Shaw (1856–1950)
“Eddie did not die. He is no longer on Channel 4, and our sets are tuned to Channel 4; he’s on Channel 7, but he’s still broadcasting. Physical incarnation is highly overrated; it is one corner of universal possibility.”
—Marianne Williamson (b. 1953)