Unimodular triangulations of simplicial cones by short vectors
classification
🧮 math.CO
keywords
vectorsboundconeslengthmultiplicityprimesimplicialunimodular
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.