An optimization problem related to Minkowski's successive minima (Q972598): Difference between revisions

The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a \(0\)-symmetric convex body with its successive minima. To this end, the author introduces an optimization problem whose solution refines former methods, thus producing a better upper bound. In particular, the author shows that an analogue of Minkowski's second theorem on successive minima with the volume replaced by lattice point enumerator is true up to an exponential factor, whose base is approximately 1.64.