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:
“A few ideas seem to be agreed upon. Help none but those who help themselves. Educate only at schools which provide in some form for industrial education. These two points should be insisted upon. Let the normal instruction be that men must earn their own living, and that by the labor of their hands as far as may be. This is the gospel of salvation for the colored man. Let the labor not be servile, but in manly occupations like that of the carpenter, the farmer, and the blacksmith.”
—Rutherford Birchard Hayes (1822–1893)
“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)