Abstract
A closed, convex set K in \({\mathbb{R}^2}\) with non-empty interior is called lattice-free if the interior of K is disjoint with \({\mathbb{Z}^2}\). In this paper we study the relation between the area and the lattice width of a planar lattice-free convex set in the general and centrally symmetric case. A correspondence between lattice width on the one hand and covering minima on the other, allows us to reformulate our results in terms of covering minima introduced by Kannan and Lovász (Ann Math (2) 128(3):577–602, 1988). We obtain a sharp upper bound for the area for any given value of the lattice width. The lattice-free convex sets satisfying the upper bound are characterized. Lower bounds are studied as well. Parts of our results are applied in Averkov et al. (Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three, http://arxiv.org/abs/1010.1077, 2010) for cutting plane generation in mixed integer linear optimization, which was the original inducement for this paper. We further rectify a result of Kannan and Lovász (Ann Math (2) 128(3):577–602, 1988) with a new proof.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three (2010). http://arxiv.org/abs/1010.1077
Basu A., Conforti M., Cornuéjols G., Zambelli G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3), 704–720 (2010)
Betke U., Henk M., Wills J.M.: Successive-minima-type inequalities. Discr. Comput. Geom. 9(2), 165–175 (1993) MR 93j:52026
Coxeter H.S.M.: Introduction to Geometry. Wiley Classics Library, Wiley, New York (1989) (Reprint of the 1969 edition MR 90a:51001)
Dey S.S., Wolsey L.A.: Two row mixed integer cuts via lifting, Technical Report CORE DP 30. Université catholique de Louvain, Louvain-la-Neuve, Belgium (2008)
Fáry I., Rédei L.: Der zentralsymmetrische Kern und die zentralsymmetrische Hülle von konvexen Körpern. Math. Ann. 122, 205–220 (1950) MR 12,526g
Fejes Tóth L., Makai E. Jr.: On the thinnest non-separable lattice of convex plates. Stud. Sci. Math. Hungar. 9, 191–193 (1974) (MR 51 #6596)
Gruber, P.M.: Convex and Discrete Geometry, Grundlehren der Mathematischen Wissenschaften, vol. 336. Springer, Berlin (MR 2008f:52001) (2007)
Gruber, P.M., Lekkerkerker, C.G.: Geometry of Numbers, 2nd ed., North-Holland Mathematical Library, vol. 37. North-Holland Publishing Co., Amsterdam (MR 88j:11034 1987) (1987)
Hajós G.: Über einfache und mehrfache Bedeckung des n-dimensionalen Raumes mit einem Würfelgitter. Mathematische Zeitschrift 47, 427–467 (1941) (MR 3,302b)
Hurkens C.A.J.: Blowing up convex sets in the plane. Linear Algebra Appl. 134, 121–128 (1990) (MR 91i:52009)
Kannan, R., Lovász, L.: Covering minima and lattice point free convex bodies, Foundations of software technology and theoretical computer science (New Delhi, 1986), Lecture Notes in Computer Science, vol. 241, pp. 193–213. Springer, Berlin (MR 89b:11055) (1986)
Kannan R., Lovász L.: Covering minima and lattice-point-free convex bodies. Ann. Math. (2) 128(3), 577–602 (1988) (MR 89i:52020)
Khinchin A.Ya.: A quantitative formulation of the approximation theory of Kronecker. Izv. Akad. Nauk SSSR Ser. Mat. 12(2), 113–122 (1948)
Lovász, L.: Geometry of numbers and integer programming. In: Math. Prog., Recent Developments and Applications. Kluwer Academic Publishers, Dordrecht, pp. 177–201 (1989)
Mahler K.: Ein Übertragungsprinzip für lineare Ungleichungen. Časopis Pěst. Mat. Fys. 68, 85–92 (1939) (MR 1,202b)
Makai E. Jr.: On the thinnest non-separable lattice of convex bodies. Stud. Sci. Math. Hungar. 13(1–2), 19–27 (1978) (MR 83a:52016)
Schnell U.: A Minkowski-type theorem for covering minima in the plane. Geom. Dedicata 55(3), 247–255 (1995) (MR 96f:52020)
Schrijver A.: Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester (1986) (MR 88m:90090)
Schulte, E.: Tilings, Handbook of Convex Geometry, vol. A, B, pp. 899–932 North-Holland, Amsterdam (MR 94g:52026) (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Averkov, G., Wagner, C. Inequalities for the lattice width of lattice-free convex sets in the plane. Beitr Algebra Geom 53, 1–23 (2012). https://doi.org/10.1007/s13366-011-0028-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13366-011-0028-8