Unimodular triangulations of dilated 3-polytopes

  title={Unimodular triangulations of dilated 3-polytopes},
  author={Francisco Santos and G{\"u}nter M. Ziegler},
  journal={Transactions of the Moscow Mathematical Society},
A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation. In dimension 3, Kantor and Sarkaria (2003) have shown that $k=4$ works for every polytope. But this does not imply that every $k>4$ works as well. We here study the values of $k$ for which the result holds showing that: 1. It contains all composite numbers… Expand
Existence of regular unimodular triangulations of dilated empty simplices
The necessary and sufficient condition for the k-th dilation of the P of an empty simplex to have a regular unimodular triangulation is presented. Expand
Lattice 3-Polytopes with Few Lattice Points
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
Classification of empty lattice 4-simplices of width larger than two
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
Unimodular covers of 3-dimensional parallelepipeds and Cayley sums
We show that the following classes of lattice polytopes have unimodular covers, in dimension three: the class of parallelepipeds, the class of centrally symmetric polytopes, and the class of CayleyExpand
Existence of unimodular triangulations — positive results
Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of course, combinatorics. In this article, we review several classes ofExpand
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
Ehrhart-Equivalence, Equidecomposability, and Unimodular Equivalence of Integral Polytopes
Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still notExpand
Sums of sets of lattice points and unimodular coverings of polytopes
If P is a lattice polytope (that is, the convex hull of a finite set of lattice points in $${\mathbf{R}^n}$$Rn), then every sum of h lattice points in P is a lattice point in the h-fold sumset hP.Expand
Our treatment is very combinatorial. In particular, instead of regarding a subdivision as a set of polytopes we regard it as a set of subsets of V , whose convex hulls subdivide P . This may appearExpand
Euler and Laplace integral representations of GKZ hypergeometric functions II
We introduce an interpolation between Euler integral and Laplace integral: Euler-Laplace integral. We show, when parameters $d$ of the integrand is non-resonant, the $\mathcal{D}$-moduleExpand


On Primitive Subdivisions of an Elementary Tetrahedron
A polytope P of 3-space, which meets a given lattice L only in its vertices, is called L-elementary. An L-elementary tetrahedron has volume > (1/6). det(L), in case equality holds it is calledExpand
An Introduction to Empty Lattice Simplices
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
An Introduction to Empty Lattice-simplices
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
Integral Polyhedra in Three Space
In a series of recent papers I have introduced a particular class of convex polyhedra in Rn, arising in the study of integer programming problems with n variables. In the present paper a detailedExpand
Clean Lattice Tetrahedra
A clean lattice tetrahedron is a non-degenerate tetrahedron with the property that the only lattice points on its boundary are its vertices. We present some new proofs of old results and some newExpand
White: Lattice tetrahedra
  • Canadian J. Math
  • 1964
Integral polyhedra in three space, Math
  • Oper. Res
  • 1985
Construction of nice polyhedral subdivisions, Chapter 3 of “Toroidal Embeddings I
  • Lecture Notes in Mathematics
  • 1973
Construction of nice polyhedral subdivisions, Chapter 3 of “Toroidal Embeddings I
  • Lecture Notes in Mathematics
  • 1973
Lattice tetrahedra
  • Canadian J. Math. 1964
  • 1964