There are only two nonobtuse binary triangulations of the unit \(n\)-cube (Q1931275): Difference between revisions

Simplexity of the unit cube \(I^n\), that is, its triangulations into a minimal number of simplices without additional vertices, is known for \(3\leq n \leq 7\) (see, [\textit{P. S. Mara}, J. Comb. Theory, Ser. A 20, 170--177 (1976; Zbl 0341.50001); \textit{R. B. Hughes} and \textit{M. R. Anderson}, Discrete Math. 158, No. 1--3, 99--150 (1996; Zbl 0862.52005)]). The authors study triangulations of \(I^n\) with simplices that only have nonobtuse dihedral angles. For \(3 \leq n \), it is shown that besides the standard triangulation into \(n! \) simplices, there exists another family of nonobtuse binary triangulations. The number of simplices in the foregoing family is been determined in terms of a certain reduction formula, with its value as 5 for \(n=3\).