scientific article; zbMATH DE number 4006346

From MaRDI portal
Publication:3757974





[For the entire collection see Zbl 0597.00033.] The authors generalize the concept of the covering radius from the geometry of numbers to that of covering minima: For a convex body K of \({\mathbb{R}}^ n\) the j-th covering minima is defined as the infimum \(\mu_ j\) of all positive real numbers t such that \(tK+{\mathbb{Z}}^ n\) intersects all n-j dimensional affine subspaces of \({\mathbb{R}}^ n\) (0\(\leq j\leq n)\). This concept enables them to get better bounds in estimates involving constants related to convex bodies and lattices. Thus they can reduce an integer programming problem of dimension n to \(O(n^ 2)\) integer programming problems of dimension n-1 (best bound known before: \(O(n^{5/2}))\). They also prove a theorem on convex bodies in \({\mathbb{R}}^ n\) centrally symmetric about any lattice point which they claim to be a natural extension of Minkowski's convex body theorem. The authors mention that this is just a preliminary version of a final paper and it is to be hoped that the latter will not contain so many misprints.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757974)