Lower bounds for the simplexity of the n-cube

Abstract

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional vertices is at least $(n+1{)}^{\frac{n-1}{2}}$.

10 pages

References in corpus (2)

• Lectures on 0/1-polytopes
• Asymptotically efficient triangulations of the d-cube

Cited by in corpus (2)

• There are only two nonobtuse binary triangulations of the unit $n$-cube
• Errata and Addenda to Mathematical Constants