Unimodular triangulations of simplicial cones by short vectors

DOI10.1016/J.JCTA.2017.02.005MaRDI QIDQ2397102zbMATH OpenOpenAlexFDO

Authors Winfried Bruns, Michael von Thaden

Publication date 29 May 2017

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.05208

zbMATH Keywords

simplicial conestellar subdivisionunimodular triangulation

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polyhedral manifolds (52B70) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorial complexity of geometric structures (52C45)

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.

Recommendations

• Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones
• Unimodular triangulations of dilated 3-polytopes
• Unimodular covers of multiples of polytopes
• Unimodular covers and triangulations of lattice polytopes
• Existence of unimodular triangulations -- positive results

Cites work

• Approximate formulas for some functions of prime numbers
• Existence of unimodular triangulations -- positive results
• Polytopes, Rings, and K-Theory
• Unimodular covers and triangulations of lattice polytopes
• Unimodular covers of multiples of polytopes

Cited in

(5)

• Existence of regular unimodular triangulations of dilated empty simplices
• Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones
• scientific article; zbMATH DE number 1972778 (Why is no real title available?)
• Unimodular triangulations in Łukasiewicz logic: complexity bounds of probabilistic coherence
• Integer Carathéodory results with bounded multiplicity

This page was built for publication: Unimodular triangulations of simplicial cones by short vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397102)