Editing Lattice (group) (section)

==Lattice points in convex sets==
[[Minkowski's theorem]] relates the number d(<math>\Lambda</math>) 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(<math>\Lambda</math>) as well.

{{see also|Integer points in polyhedra}}