# Covering minima and lattice point free convex bodies

• Ravi Kannan
• László Lovász
Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 241)

## Abstract

Suppose K is a convex set of nonzero volume in Euclidean n-space Rn and it is symmetric about the origin (i.e., if x belongs to K, so does - x). For any real number t, let tK={tx : xK}. The infimum over all positive real numbers t such that if a copy of tK is placed centered at every integer point, all of Rn is covered, is called the “covering radius” of K (with respect to the lattice Zn). The covering radius and related quantities have been studied extensively in Geometry of Numbers. In this paper, we define and study the “covering minima” of a convex body which is not necessarily symmetric about the origin; the covering radius will be a special case of one of of these minima. This extension to general convex bodies has among other things, applications to algorithms for Integer Programming which was our initial motivation. This motivation is explained in some detail later. We use the results of the paper to derive bounds on the width of lattice point free convex bodies and analyze their structure.

## Keywords

Distance Function Lattice Point Convex Body Polynomial Time Algorithm Covering Minimum

## References

1. J. Bourgain and V.D. Milman, Sections euclidiennes et volume des corps symetriques convexes dans R n, C.R.Acad. Sc. Paris, t. 300, Série I,n 13, (1985) pp435–438Google Scholar
2. J.W.S.Cassels, An introduction to the geometry of numbers Springer Verlag (1971)Google Scholar
3. A.Frank and E.Tardos, An application of simultaneous approximation in combinatorial optimization, Report Institut für Ökonometrie und Operations Research, Uni. Bonn, W.Germany (1985) to appear in Combinatorica.Google Scholar
6. R.Kannan, Improved algorithms for integer programming and related lattice problems 15 th Annual ACM symposium on theory of computing (1983) pp193–206. Revised version Minkowski's Convex body theorem and integer programming, Carnegie-Mellon University Computer Science Dept. Technical Report CMU-CS-86-105 (1986)Google Scholar
7. N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4, pp373–396 (1984)Google Scholar
8. A. Korkine and G. Zolotarav, Sur les formes quadratiques, Math. Annalen 6, (1873) pp 366–389Google Scholar
9. J.Lagarias, H.W.Lenstra and C.P.Schnorr, Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Manuscript (1986)Google Scholar
10. C.G. Lekkerkerker, Geometry of Numbers North Holland, Amsterdam, (1969)Google Scholar
11. A.K. Lenstra, H.W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients Mathematische Annalen 261 (1982), pp513–534Google Scholar
12. H.W. Lenstra, Integer programming with a fixed number of variables First announcement (1979) Mathematics of Operations research, Volume 8, Number 4 Nov (1983) pp 538–548Google Scholar
13. L. Lovász, An algorithmic theory of numbers, graphs and convexity, Report number 85368-OR, Institut für Operations Research, univerität Bonn, Bonn (1985)Google Scholar
14. K.Mahler, On lattice points in polar reciprocal domains, Proc. Kon. Ned. Wet. 51 pp 482–485 (=Indag. Math. 10, pp176–179) (1948)Google Scholar
15. J. Milnor and D. Husemoller, Symmetric bilinear forms Springer-Verlag, Berlin (1973).Google Scholar