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:
“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)
“The believing mind reaches its perihelion in the so-called Liberals. They believe in each and every quack who sets up his booth in the fairgrounds, including the Communists. The Communists have some talents too, but they always fall short of believing in the Liberals.”
—H.L. (Henry Lewis)