login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238820 Number of triangulations of the vertex set of the n-dimensional cube. 4

%I #22 Nov 13 2022 08:35:53

%S 1,1,2,74,92487256

%N Number of triangulations of the vertex set of the n-dimensional cube.

%C The number of triangulations of the n-cube is a distant cousin of Catalan numbers as they both count triangulations of some set of points. - _Lionel Pournin_, Mar 06 2014

%D Lionel Pournin, The flip-graph of the 4-dimensional cube is connected, Discrete Comput. Geom. 49 (2013), no. 3, 511--530.MR3038527

%H Michael Joswig, Max Klimm, and Sylvain Spitz, <a href="https://arxiv.org/abs/2211.01907">The Polyhedral Geometry of Truthful Auctions</a>, arXiv:2211.01907 [cs.GT], 2022. See Table 1 at page 8.

%H Lionel Pournin, <a href="https://arxiv.org/abs/1201.6543">The flip-graph of the 4-dimensional cube is connected</a>, arXiv:1201.6543 [math.MG], 2012.

%Y Cf. A238821.

%K nonn,hard,more

%O 0,3

%A _N. J. A. Sloane_, Mar 06 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 18:53 EDT 2024. Contains 372313 sequences. (Running on oeis4.)