Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) (Q685587)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum-cardinality triangulations of the d-cube for d=5 and d=6 |
scientific article; zbMATH DE number 417457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) |
scientific article; zbMATH DE number 417457 |
Statements
Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) (English)
0 references
17 March 1994
0 references
For the \(d\)-cube \(I^ d\) the main results in this paper are: (A) Any triangulation of \(I^ 5\) contains at least 67 simplices, and (B) Any corner-slicing triangulation of \(I^ 6\) contains at least 324 simplices. The obtained number in (B) is the best possible one, as shown by an example.
0 references
\(d\)-cube
0 references
simplex
0 references
vertex
0 references
face
0 references
triangulation
0 references
corner-slicing
0 references
0 references
0 references
0.83443886
0 references
0.8320963
0 references
0.82692146
0 references
0 references
0 references
0.82517624
0 references
0.8232038
0 references
