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:
“Wonderful “Force of Public Opinion!” We must act and walk in all points as it prescribes; follow the traffic it bids us, realise the sum of money, the degree of “influence” it expects of us, or we shall be lightly esteemed; certain mouthfuls of articulate wind will be blown at us, and this what mortal courage can front?”
—Thomas Carlyle (1795–1881)
“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)