login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019502 Number of simplices in minimal decomposition of n-cube. 6
1, 2, 5, 16, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

H. T. Croft, K. J. Falconer and R. K. Guy, Unsolved Problems in Geometry, Section C9.

LINKS

Table of n, a(n) for n=1..5.

A. Bliss, F. E. Su, Lower bounds for simplicial covers and triangulations of cubes, arXiv:math/0310142 [math.CO], 2003 (see Table 1 page 4).

A. Bliss, F. E. Su. Lower bounds for simplicial covers and triangulations of cubes, Discrete Comput. Geom. 33 (2005), 669-686.

John F. Sallee, A note on minimal triangulations of an n-cube,  Discrete Appl. Math. 4 (1982), no. 3, 211--215. MR0675850 (84g:52019).

John F. Sallee, The middle-cut triangulations of the n-cube, SIAM J. Algebraic Discrete Methods 5 (1984), no. 3, 407--419. MR0752044 (86c:05054). See Table 2.

John F. Sallee, A triangulation of the n-cube, Discrete Math. 40 (1982), no. 1, 81--86. MR0676714 (84d:05065b).

R. B. Hughes and M. R. Anderson, Simplexity of the cube Discrete Math., 158(1-3):99-150, 1996.

CROSSREFS

Other sequences dealing with different ways to attack this problem. They give further references: A019503, A019504, A166932, A166932, A239912, A275518.

See also A094294, A238820, A238821.

Sequence in context: A084785 A124551 A005157 * A019503 A019504 A239912

Adjacent sequences:  A019499 A019500 A019501 * A019503 A019504 A019505

KEYWORD

nonn,hard,nice,more

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 13:01 EDT 2019. Contains 328222 sequences. (Running on oeis4.)