A proof of Lovász's theorem on maximal lattice-free sets

2011/10/05 by Gennadiy Averkov, Averkov, Gennadiy
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Control (math.OC) #math.CO #math.MG #math.OC

paper · pdf · doi:10.48550/arxiv.1110.1014

arxiv created 2011/10/05 · arxiv updated 2011/10/06

Abstract

Let K be a maximal lattice-free set in ℝ^d, that is, K is convex and closed subset of ℝ^d, the interior of K does not cointain points of ℤ^d and K is inclusion-maximal with respect to the above properties. A result of Lovász assert that if K is d-dimensional, then K is a polyhedron with at most 2^d facets, and the recession cone of K is spanned by vectors from ℤ^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 gemetry of numbers. We remark that the result of Lovász is relevant in integer and mixed-integer optimization.

Related

• Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
• On finitely generated closures in the theory of cutting planes
• On maximal S-free sets and the Helly number for the family of S-convex sets
• Difference between families of weakly and strongly maximal integral lattice-free polytopes
• A characterization of maximal homogeneous-quadratic-free sets