A note on triangulating the 5-cube (Q802144): Difference between revisions

Let \(I^ 5\) denote the 5-cube with vertices \(v(v_ 1,,,,v_ 5)\); \(v_ i\in \{0,1\}\). A vertex v is odd [even] if the sum of its coordinates is odd [even]. A triangulation of \(I^ 5\) consists of simplices whose vertices are also vertices of \(I^ 5\). A complete truncation of \(I^ 5\) is a truncation of \(I^ 5\) at each even [or each odd] vertex. The authors show that a triangulation of \(I^ 5\) using complete truncation can have no less than 67 pieces and no more than 68 pieces.