# 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} }

<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

- Mathematics
- 2018

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-free… Expand

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. The… Expand

Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3

- Mathematics, Computer Science
- DGCI
- 2017

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

- Mathematics, Computer Science
- Adv. Appl. Math.
- 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

- Mathematics
- 2019

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 started… Expand

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 of… Expand

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 179… Expand

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

#### References

SHOWING 1-10 OF 45 REFERENCES

On the enumeration of lattice $3$-polytopes

- Mathematics
- 2016

A lattice $3$-polytope is a polytope $P$ with integer vertices. We call size of $P$ the number of lattice points it contains, and width of $P$ the minimum, over all integer linear functionals $f$, of… Expand

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. The… Expand

Distances Between Non-symmetric Convex Bodies and the
$$MM^* $$
-estimate

- Mathematics
- 1998

AbstractLet K, D be n-dimensional convex bodes. Define the distance between K and D as
$$d(K,D) = \inf \{ \lambda |TK \subset D + x \subset \lambda \cdot TK\} ,$$
where the infimum is taken over… Expand

Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three

- Computer Science, Mathematics
- Math. Oper. Res.
- 2017

This article considers the remaining case $d = 3$ and proves that for integral polyhedra the notions of $\mathbb{R}^3$-maximality and $\Mathbb{Z}$- maximality are equivalent. Expand

Lattice 3-Polytopes with Few Lattice Points

- Computer Science, Mathematics
- SIAM J. Discret. Math.
- 2016

This work gives explicit coordinates for representatives of each class, together with other invariants such as their oriented matroid (or order type) and volume vector, and classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. Expand

Enumeration of Lattice 3-Polytopes by Their Number of Lattice Points

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2018

It is proved that if P is a lattice 3-polytope of width larger than one and with at least seven lattice points then it fits in one of three categories that the authors call boxed, spiked and merged. Expand

Projecting Lattice Polytopes Without Interior Lattice Points

- Mathematics, Computer Science
- Math. Oper. Res.
- 2011

We show that up to unimodular equivalence in each dimension there are only finitely many lattice polytopes without interior lattice points that do not admit a lattice projection onto a… Expand

An Introduction to Empty Lattice-simplices

- 1999

We study simplices whose vertices lie on a lattice and have no other lattice points. Suchèmpty lattice simplices' come up in the theory of integer programming, and in some combi-natorial problems.… Expand

Lattice Polytopes with Distinct Pair-Sums

- Computer Science, Mathematics
- Discret. Comput. Geom.
- 2002

It is shown that if P is a dps polytope in Rn, then N≤ 2n , and, for every n, the polytopes in RN which contain 2n lattice points are constructed. Expand

An Introduction to Empty Lattice Simplices

- Computer Science, Mathematics
- IPCO
- 1999

It is already NP-complete to decide whether the width of a very special class of integer simplices is 1, and it is provided for every n ≥ 3 a simple example of n-dimensional emptyinteger simplices of width n - 2, improving on earlier bounds. Expand