Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777536 | Journal of Combinatorial Theory, Series A | 2017 | 15 Pages |
Abstract
We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is based on a successive reduction of the highest prime divisor of the multiplicity and uses the prime number theorem to control the length of the subdividing vectors.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Winfried Bruns, Michael von Thaden,