Search arXivSearch

arXiv · 1509.05200

Notions of maximality for integral lattice-free polyhedra: the case of dimension three

Abstract

Lattice-free sets (convex subsets of $\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral lattice-free polyhedra which are not properly contained in another integral lattice-free polyhedron has been of particular interest. We call these polyhedra $\mathbb{Z}^d$-maximal. It is known that, for fixed $d$, the family $\mathbb{Z}^d$-maximal integral lattice-free polyhedra is finite up to unimodular equivalence. In view of possible applications in cutting-plane theory, one would like to have a classification of this family. However, this turns out to be a challenging task already for small dimensions. In contrast, the subfamily of all integral lattice-free polyhedra which are not properly contained in any other lattice-free set, which we call $\mathbb{R}^d$-maximal lattice-free polyhedra, allow a rather simple geometric characterization. Hence, the question was raised for which dimensions the notions of $\mathbb{Z}^d$-maximality and $\mathbb{R}^d$-maximality are equivalent. This was known to be the case for dimensions one and two. On the other hand, Nill and Ziegler (2011) showed that for dimension $d \ge 4$, there exist polyhedra which are $\mathbb{Z}^d$-maximal but not $\mathbb{R}^d$-maximal. In this article, we consider the remaining case $d = 3$ and prove that for integral polyhedra the notions of $\mathbb{R}^3$-maximality and $\mathbb{Z}^3$-maximality are equivalent. As a consequence, the classification of all $\mathbb{R}^3$-maximal integral polyhedra by Averkov, Wagner and Weismantel (2011) contains all $\mathbb{Z}^3$-maximal integral polyhedra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge. 2015-09-17. Notions of maximality for integral lattice-free polyhedra: the case of dimension three. https://arxiv.org/abs/1509.05200

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO