A166932 Lower bounds for minimal number of simplices in a triangulation of the n-dimensional cube (A019503).

5, 16, 67, 308, 1493, 5522

Offset: 3

Author

Jonathan Vos Post, Oct 24 2009

Keywords

• nonn
• less

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

• 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.