The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A019503 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A019503

Simplexity of the n-cube: minimal cardinality of triangulation of n-cube using n-simplices whose vertices are vertices of the n-cube.
(history; published version)

#39 by Joerg Arndt at Fri Nov 17 05:47:50 EST 2017

STATUS

editing

approved

#38 by Joerg Arndt at Fri Nov 17 05:47:26 EST 2017

COMMENTS

5522 <= a(8) <= 11944 [Haiman, Ziegler]. - Jonathan Vos Post, Jul 13 2005

FORMULA

5522 <= a(8) <= 11944 [Haiman, Ziegler]. For large n, a method due to Smith, using volume estimates in hyperbolic geometry, yields the best lower bounds on a(n) so far. - Jonathan Vos Post, Jul 13 2005

STATUS

approved

editing

#37 by Bruno Berselli at Fri Nov 17 03:41:31 EST 2017

STATUS

reviewed

approved

#36 by Michel Marcus at Fri Nov 17 03:33:24 EST 2017

STATUS

proposed

reviewed

#35 by Andrey Zabolotskiy at Fri Nov 17 02:04:56 EST 2017

STATUS

editing

proposed

Discussion

Fri Nov 17

02:16

Michel Marcus: so add A275518?

02:29

Andrey Zabolotskiy: Done already (OEIS diff apparently needs improvement...)

03:33

Michel Marcus: no, it's my eyes

#34 by Andrey Zabolotskiy at Fri Nov 17 02:04:50 EST 2017

CROSSREFS

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

STATUS

approved

editing

#33 by R. J. Mathar at Sat Feb 06 17:39:37 EST 2016

STATUS

editing

approved

#32 by R. J. Mathar at Sat Feb 06 17:39:22 EST 2016

LINKS

D. Orden, F. Santos, <a href="http://dx.doi.org/10.1007/s00454-003-2845-5">Asymptotically efficient triangulations of the d-cube</a>, Discr. Comput. Geom. 30 (2003) 509, Table 1.

STATUS

approved

editing

#31 by Bruno Berselli at Mon Mar 09 05:33:35 EDT 2015

STATUS

reviewed

approved

#30 by Peter Luschny at Mon Mar 09 03:47:07 EDT 2015

STATUS

proposed

reviewed