Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) (Q685587): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127884460, #quickstatements; #temporary_batch_1722280142910 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127884460 / rank | |||
Normal rank | |||
Latest revision as of 21:10, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) |
scientific article |
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
