A triangulation of the 6-cube with 308 simplices (Q686174): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90339-u / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972135515 / rank | |||
Normal rank | |||
Latest revision as of 08:29, 30 July 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
