Covering minima and lattice-point-free convex bodies
From MaRDI portal
Publication:1112339
DOI10.2307/1971436zbMath0659.52004OpenAlexW2334989808MaRDI QIDQ1112339
László Lovász, Ravindran Kannan
Publication date: 1988
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1971436
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)
Related Items
Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results, Covering convex bodies by cylinders and lattice points by flats, Isosystolic inequalities for optical hypersurfaces, Homometry and direct-sum decompositions of lattice-convex sets, Lattice-free polytopes and their diameter, Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\), On integer programming with bounded determinants, A Minkowski-type theorem for covering minima in the plane, Diophantine approximation of matrices, Interpolating between volume and lattice point enumerator with successive minima, An optimal lower bound for the Frobenius problem, Covering sets for plane lattices, Area-diameter and area-width relations for covering plane sets, On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace, A discrete version of Koldobsky's slicing inequality, EXPECTED MEAN WIDTH OF THE RANDOMIZED INTEGER CONVEX HULL, Extending Gromov's optimal systolic inequality, Reverse split rank, Enumeration and unimodular equivalence of empty delta-modular simplices, Generalized flatness constants, spanning lattice polytopes, and the Gromov width, The simultaneous packing and covering constants in the plane, Some questions related to the reverse Minkowski theorem, Random points and lattice points in convex bodies, Corrigendum to: ``Successive minima of line bundles, Lattice-point enumerators of ellipsoids, On the number of lattice free polytopes, On the maximal width of empty lattice simplices, Inequalities for the lattice width of lattice-free convex sets in the plane, Classification of empty lattice 4-simplices of width larger than two, The probability that a convex body intersects the integer lattice in a \(k\)-dimensional set, A randomized sieving algorithm for approximate integer programming, Asymptotically saturated toric algebras, Some new examples of recurrence and non-recurrence sets for products of rotations on the unit circle, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, An Optimization Problem for Lattices, Non-standard approaches to integer programming, Successive-minima-type inequalities, A linear algorithm for integer programming in the plane, Mahler's work on the geometry of numbers, A local maximizer for lattice width of 3-dimensional hollow bodies, On the rational polytopes with Chvátal rank 1, Hollow polytopes of large width, Minkowski's successive minima and the zeros of a convexity-function, The finiteness threshold width of lattice polytopes, Successive minima of line bundles, Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity, The covering radius and a discrete surface area for non-hollow simplices, Diophantine transference inequalities: weighted, inhomogeneous, and intermediate exponents, Test sets of integer programs, Computing the covering radius of a polytope with an application to lonely runners, Effective limit distribution of the Frobenius numbers, The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point, From deep holes to free planes
