Lattice Points - Lattice Points in Convex Sets

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:

    In writing biography, fact and fiction shouldn’t be mixed. And if they are, the fictional points should be printed in red ink, the facts printed in black ink.
    Catherine Drinker Bowen (1897–1973)

    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)