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:
“The men who carry their points do not need to inquire of their constituents what they should say, but are themselves the country which they represent: nowhere are its emotions or opinions so instant and so true as in them; nowhere so pure from a selfish infusion.”
—Ralph Waldo Emerson (1803–1882)
“A horse, a buggy and several sets of harness, valued in all at about $250, were stolen last night from the stable of Howard Quinlan, near Kingsville. The county police are at work on the case, but so far no trace of either thieves or booty has been found.”
—H.L. (Henry Lewis)