Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones

DOI10.1016/J.JCTA.2021.105421MaRDI QIDQ2229183zbMATH OpenOpenAlexFDO

Authors Michael von Thaden

Publication date 22 February 2021

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

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

zbMATH Keywords

simplicial conestellar subdivisionunimodular triangulation

Mathematics Subject Classification ID

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

Abstract: In a recent paper, Bruns and von Thaden established 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 authors mentioned that the next goal would be a bound that is polynomial in the multiplicity but not knowing if such a bound exists. In this paper we will prove that such a bound, which is polynomial in the multiplicity $mu$, indeed exists. In detail, the bound is of the type $m{u}^{f(d)}$ with $f(d)inmathcalO(d)$.

Recommendations

• Unimodular triangulations of simplicial cones by short vectors
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• scientific article; zbMATH DE number 718849
• The complexity of finding small triangulations of convex 3-polytopes
• Triangulations of simplices with vanishing local \(h\)-polynomial
• Triangulations of simplicial polytopes
• Approximation for minimum triangulations of simplicial convex 3-polytopes
• Polynomial splines of non-uniform degree on triangulations: combinatorial bounds on the dimension
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• Existence of a regular unimodular triangulation of the edge polytopes of finite graphs

Cites work

• Approximate formulas for some functions of prime numbers
• Polytopes, Rings, and K-Theory
• Toroidal embeddings. I
• Unimodular covers of multiples of polytopes
• Unimodular triangulations of simplicial cones by short vectors

Cited in

(2)

• Unimodular triangulations of simplicial cones by short vectors
• Existence of unimodular triangulations -- positive results

This page was built for publication: Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones

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