|
|
A019503
|
|
Simplexity of the n-cube: minimal cardinality of triangulation of n-cube using n-simplices whose vertices are vertices of the n-cube.
|
|
8
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
REFERENCES
|
H. T. Croft, K. J. Falconer and R. K. Guy, Unsolved Problems in Geometry, C9.
Warren D. Smith, Lower bounds for triangulations of the N-cube, manuscript, 1994.
Gunter M. Ziegler, Lectures on Polytopes, Revised First Edn., Graduate Texts in Mathematics, Springer, 1994, p. 147.
|
|
LINKS
|
R. B. Hughes and M. R. Anderson, Simplexity of the cube, Discrete Mathematics, 158 (1996) 99-150, esp. p. 100.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,nice,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|