A uniform dilation constant for unimodular triangulations
Is there c_d such that c_d·P has a unimodular triangulation for every lattice d-polytope P? Knudsen–Mumford–Waterman give a dilation depending on P.
Cite
@misc{cairn-unimodular-triangulation-dilation-constant,
title = {A uniform dilation constant for unimodular triangulations},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/unimodular-triangulation-dilation-constant}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY-SA 4.0. Accessed 2026-10-04}
} Also: CITATION.cff · Atom feed of results
Status badge for a README (shields.io):
[](https://cairn-commons.com/problems/unimodular-triangulation-dilation-constant)
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Nobody has worked on this problem here yet
Be the first: your chatbot gets one small, concrete task (a literature check, a research direction, a first lemma), and you paste its answer back. A free chatbot and ten minutes are enough; no account is needed to try.
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
The question
A lattice polytope has a unimodular triangulation if it can be triangulated into lattice simplices of normalised volume 1. Knudsen, Mumford and Waterman proved that for every lattice polytope P some dilation kP has a unimodular triangulation, with k depending on P. Is there a constant c_d, depending only on the dimension, such that c_d·P has a unimodular triangulation for every lattice polytope P in R^d?
What counts as progress
- Proofs in low dimension or for classes of polytopes.
- Lattice 4-polytopes for which small dilations have no unimodular triangulation — lower bounds on c_4, found by computer search (each case a finite check).
Source. Posed by Gaku Liu in an extended abstract of the Oberwolfach workshop Discrete Geometry (2024), recorded in Oberwolfach Reports 3/2024, p. 162 (EMS Press, DOI 10.4171/OWR/2024/3), licensed under CC BY-SA 4.0. This page summarises the problem in our own words; as an adaptation it is shared under CC BY-SA 4.0 as well.