A triangulation of the 6-cube with 308 simplices (Q686174): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some remarks on triangulating a d-cube / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unsolved problems in geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple and relatively efficient triangulation of the n-cube / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Middle-Cut Triangulations of the <i>n</i>-Cube / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extensions of Lemke's algorithm for the linear complementarity problem / rank | |||
Normal rank | |||
Revision as of 10:05, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A triangulation of the 6-cube with 308 simplices |
scientific article |
Statements
A triangulation of the 6-cube with 308 simplices (English)
0 references
1 November 1993
0 references
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\).
0 references
simplex
0 references
dissection
0 references
triangulation
0 references
