Constrained Triangulations, Volumes of Polytopes, and Unit Equations

Abstract: Given a polytope

m a t h c a l P

in

m a t h b b R^{d}

and a subset

U

of its vertices, is there a triangulation of

m a t h c a l P

using

d

-simplices that all contain

U

? We answer this question by proving an equivalent and easy-to-check combinatorial criterion for the facets of

m a t h c a l P

. Our proof relates triangulations of

m a t h c a l P

to triangulations of its "shadow", a projection to a lower-dimensional space determined by

U

. In particular, we obtain a formula relating the volume of

m a t h c a l P

with the volume of its shadow. This leads to an exact formula for the volume of a polytope arising in the theory of unit equations.

Recommendations

Cited in

(3)

This page was built for publication: Constrained Triangulations, Volumes of Polytopes, and Unit Equations