Lower bounds for the simplexity of the \(n\)-cube (Q1759408): Difference between revisions

The precise minimum number of simplices for any simplicial triangulation of the \(n\)-cube is known only for small values of \(n\). A trivial lower bound is determined by the maximum volume of a simplex with vertices in the 0/1-cube. In the paper under review the better lower bound \((n+1)^{(n-1)/2}\) is proved. Asymptotically, this improves the bound obtained from the Euclidean volume estimate by a factor of \(e/2\approx 1.359\).