This is the authors' abstract. We don't add key points for this paper.
Let K be a maximal lattice-free set in Rᵈ, that is, K is convex and closed subset of Rᵈ, the interior of K does not cointain points of Zᵈ 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ᵈ facets, and the recession cone of K is spanned by vectors from Zᵈ. 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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Gennadiy Averkov (2011) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: