Integer decomposition of smooth polytopes
This question was asked by Tadao Oda , see also the survey of Gubeladze . The conjecture has been verified for smooth polytopes containing at most 12 lattice points , and there is no known smooth polytope without a unimodular triangulation. For cases when a unimodular triangulation is known to exist, see .
- T. Oda, Problems on Minkowski sums of convex lattice polytopes, arXiv link
- J. Gubeladze, Normal polytopes, manuscript
- T. Bogart et al., Few smooth d-polytopes with n lattice points, arXiv link
- C. Haase, A. Paffenholz, L.C. Piechnik, F. Santos, Existence of unimodular triangulations - positive results, arXiv link