Abstract
Let K be a maximal lattice-free set in \({\mathbb{R}^d}\) , that is, K is convex and closed subset of \({\mathbb{R}^d}\) , the interior of K does not contain points of \({\mathbb{Z}^d}\) and K is inclusion-maximal with respect to the above properties. A result of Lovász asserts that if K is d-dimensional, then K is a polyhedron with at most 2d facets, and the recession cone of K is a linear space spanned by vectors from \({\mathbb{Z}^d}\) . A first complete proof of mentioned Lovász’s result has been published in a paper of Basu, Conforti, Cornuéjols and Zambelli (where the authors use Dirichlet’s approximation as a tool). The aim of this note is to give another proof of this result. Our proof relies on Minkowki’s first fundamental theorem from the geometry of numbers. We remark that the result of Lovász is relevant in integer and mixed-integer optimization.
Similar content being viewed by others
References
Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. Integer programming and combinatorial optimization. Lecture Notes in Comput Sci, vol. 4513, pp. 1–15. Springer, Berlin (2007)
Balas E.: Intersection cuts—a new type of cutting planes for integer programming. Operations Res. 19, 19–39 (1971)
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)
Bell D.E.: A theorem concerning the integer lattice. Stud. Appl. Math. 56(2), 187–188 (1977)
Doignon J.-P.: Convexity in crystallographical lattices. J. Geometry 3, 71–85 (1973)
Gruber, P.M.: Convex and discrete geometry. In: Grundlehren der Mathematischen Wissenschaften, vol. 336. Springer, Berlin (2007)
Gruber, P.M., Lekkerkerker, C.G.: Geometry of Numbers. In: North-Holland Mathematical Library, vol. 37, 2nd edn. North-Holland Publishing Co., Amsterdam (1987)
Lovász, L.: Geometry of numbers and integer programming, mathematical programming (Tokyo, 1988) Math. Appl. vol. 6, pp. 177–201. SCIPRESS, Tokyo (1989, Japanese Ser.)
Scarf H.E.: An observation on the structure of production sets with indivisibilities. Proc. Natl. Acad. Sci. USA 74(9), 3637–3641 (1977)
Schneider, R.: Convex bodies: the Brunn–Minkowski theory. In: Encyclopedia of Mathematics and its Applications, vol. 44. Cambridge University Press, Cambridge (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Averkov, G. A proof of Lovász’s theorem on maximal lattice-free sets. Beitr Algebra Geom 54, 105–109 (2013). https://doi.org/10.1007/s13366-012-0092-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13366-012-0092-8