<
Huang-Lauff-Zhang
Séminaire Lotharingien de Combinatoire, 95B.54 (2026), 12 pp.
Kyle Huang, Robert Lauff and Charles Zhang
UniTriSat: Unimodular Triangulations via SATISFIABILITY
Abstract.
Given a lattice polytope, it is natural to ask if it has a unimodular
triangulation. Unimodular triangulations have connections to toric
geometry, tropical geometry, and enumerative combinatorics, while also
being an interesting property in their own right, for various classes
of lattice polytopes. With the Julia
package UniTriSat, we present a new algorithm for computing
unimodular triangulations and regular unimodular triangulations, via
translation to a SATISFIABILITY problem.
Received: November 15, 2025.
Accepted: February 15, 2026.
Final version: April 1, 2026.
The following versions are available: