A triangulation of the 6-cube with 308 simplices (Q686174): Difference between revisions

Let \(S(d)\) denote the smallest number of \(d\)-dimensional simplexes into which the \(d\)-dimensional cube can be dissected. It is known that \(S(2)=2\), \(S(3)=5\), \(S(4) =16\), \(S(5)=67\) and \(223 \leq S(6) \leq 344\). The authors exhibit a triangulation of the 6-cube into 308 simplexes, so \(S(6) \leq 308\).