# The finiteness threshold width of lattice polytopes

@article{Blanco2016TheFT,
title={The finiteness threshold width of lattice polytopes},
author={M{\'o}nica Blanco and Christian Haase and Jan Hofmann and Francisco Santos},
journal={Transactions of the American Mathematical Society, Series B},
year={2016}
}
• Mónica Blanco, +1 author F. Santos
• Published 2016
• Mathematics
• Transactions of the American Mathematical Society, Series B
<p>In each dimension <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="d"> <mml:semantics> <mml:mi>d</mml:mi> <mml:annotation encoding="application/x-tex">d</mml:annotation> </mml:semantics> </mml:math> </inline-formula> there is a constant <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="w Superscript normal infinity Baseline left-parenthesis d right-parenthesis… Expand
12 Citations
Difference between families of weakly and strongly maximal integral lattice-free polytopes
A $d$-dimensional closed convex set $K$ in $\mathbb{R}^d$ is said to be lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^d$. We consider the following two families of lattice-freeExpand
Classification of empty lattice 4-simplices of width larger than two
• Mathematics
• 2017
A lattice $d$-simplex is the convex hull of $d+1$ affinely independent integer points in ${\mathbb R}^d$. It is called empty if it contains no lattice point apart of its $d+1$ vertices. TheExpand
Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3
The problem to determine whether there exists a (rational) polyhedron with at most n faces and verifying $$P \cap \mathbb {Z}^d= S$$ is decidable is considered. Expand
Complexity of linear relaxations in integer programming
• Mathematics
• 2020
For a set $X$ of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with $X$ is called the relaxation complexity $\mathrm{rc}(X)$.Expand
Local optimality of Zaks-Perles-Wills simplices
• G. Averkov
• Mathematics, Computer Science
• 2020
It is shown that S_{d,k} is a volume maximizer in the family of simplices S \in S^d(k) that have a facet with one lattice point in its relative interior that is unique up to unimodular transformations. Expand
Enumerating lattice 3-polytopes
• Computer Science, Mathematics
• Electron. Notes Discret. Math.
• 2016
This work presents a full enumeration of lattice 3-polytopes via their size and width, finding that most of them contain two proper subpolytopes of width larger than one, and thus can be obtained from the list of size n − 1 using computer algorithms. Expand
The complete classification of empty lattice $4$-simplices
An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by G. White in 1964. In dimension four, the same task was startedExpand
Classification of triples of lattice polytopes with a given mixed volume
• Mathematics
• 2019
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration ofExpand
Classification of empty lattice 4-simplices of width larger than 2
• Computer Science, Mathematics
• Electron. Notes Discret. Math.
• 2017
Abstract Combining an upper bound on the volume of empty lattice 4-simplices of large width with a computer enumeration we prove the following conjecture of Haase and Ziegler (2000): Except for 179Expand
The complete classification of empty lattice 4-simplices
• Computer Science, Mathematics
• Electron. Notes Discret. Math.
• 2018
All empty 4-simplices of width at least three are classified, including those of width two, which reveals two two-parameter families that project to the second dilation of a unimodular triangle and many more that do not. Expand