Covering minima and lattice-point-free convex bodies

DOI10.2307/1971436zbMath0659.52004MaRDI 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

zbMATH Keywords

integer programming; covering radius; lattice points; convex bodies; geometry of numbers

Mathematics Subject Classification ID

52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)

90C10: Integer programming

11H06: Lattices and convex bodies (number-theoretic aspects)

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

11H31: Lattice packing and covering (number-theoretic aspects)

Related Items

Area-diameter and area-width relations for covering plane sets, Non-standard approaches to integer programming, Minkowski's successive minima and the zeros of a convexity-function, Covering convex bodies by cylinders and lattice points by flats, An optimal lower bound for the Frobenius problem, Successive-minima-type inequalities, Test sets of integer programs, Lattice-free polytopes and their diameter, Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\), Diophantine approximation of matrices, A linear algorithm for integer programming in the plane, Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity, A Minkowski-type theorem for covering minima in the plane, Covering sets for plane lattices, On the number of lattice free polytopes, On the maximal width of empty lattice simplices, The simultaneous packing and covering constants in the plane, Asymptotically saturated toric algebras, From deep holes to free planes, Random points and lattice points in convex bodies