Lattice-point enumerators of ellipsoids

Abstract

Minkowski's second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice Λcan be bounded above by a quantity involving all the successive minima of K with respect to Λ. We will prove here that the number of lattice points inside K can also accept an upper bound of roughly the same size, in the special case where K is an ellipsoid. Whether this is also true for all K unconditionally is an open problem, but there is reasonable hope that the inductive approach used for ellipsoids could be extended to all cases.

9 pages

References in corpus (2)

• Successive Minima and Lattice Points
• A discrete analogue for Minkowski's second theorem on successive minima

Cited by in corpus (1)

• Minkowski's successive minima in convex and discrete geometry