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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166932 Lower bounds for minimal number of simplices in a triangulation of the n-dimensional cube (A019503). 5
5, 16, 67, 308, 1493, 5522 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

COMMENTS

The terms are given in Table 1 on page 2 of the Glazyrin reference.

There are many lists of bounds in different papers which differ by range, values, and methods used to obtain them. - Andrey Zabolotskiy, Nov 17 2017

LINKS

Table of n, a(n) for n=3..8.

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.

R. W. Cottle, Minimal triangulation of the 4-cube, Discrete Math., 40(1):25-29, 1982.

Alexey Glazyrin, Lower bounds for the simplexity of the n-cube, arXiv:0910.4200 [math.MG], 2009-2012 (see Table 1 page 2).

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

CROSSREFS

Cf. A019502, A019503, A019504.

Sequence in context: A026525 A007043 A128242 * A027105 A254203 A220903

Adjacent sequences:  A166929 A166930 A166931 * A166933 A166934 A166935

KEYWORD

nonn,less

AUTHOR

Jonathan Vos Post, Oct 24 2009

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 January 19 20:18 EST 2019. Contains 319310 sequences. (Running on oeis4.)