OFFSET
1,2
COMMENTS
a(n) is also the number of persistent graphs on n+1 vertices. - Malte Renken, Jun 30 2020
REFERENCES
J. Rambau and F. Santos, The Baues problem for cyclic polytopes I, In "Special issue on Combinatorics of convex polytopes" (K. Fukuda and G. M. Ziegler, eds.), European J. Combin. 21:1 (2000), 65-83.
TOPCOM: Triangulations of Point Configurations and Oriented Matroids (ZIB Report 02-17). Proceedings of the International Congress of Mathematical Software ICMS 2002.
LINKS
C. A. Athanasiadis, J. A. De Loera, V. Reiner and F. Santos, Fiber polytopes for the projections between cyclic polytopes, European Journal of Combinatorics, Volume: 21, Issue: 1, 2000, pp. 19 - 47.
M. Azaola and F. Santos, The number of triangulations of the cyclic polytope C(n,n-4), Discrete Comput. Geom., 27 (2002), 29-48.
Vincent Froese, Malte Renken, Persistent Graphs and Cyclic Polytope Triangulations, arXiv:1911.05012 [cs.DM], 2020. See Table 1.
Michael Joswig, Lars Kastner, New counts for the number of triangulations of cyclic polytopes, arXiv:1804.08029 [math.CO], 2018. See Table 1 p. 7.
J. Rambau, TOPCOM
PROG
(TOPCOM) cyclic 14 3 | points2ntriangs -v
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
reiner(AT)math.umn.edu (Victor Reiner), edelman(AT)math.umn.edu (Paul Edelman)
EXTENSIONS
a(8) and a(9) computed by J. Rambau.
a(7) corrected and a(10) computed by Jörg Rambau, Sep 19 2006, using the TOPCOM software.
Typo in a(8) fixed and a(11) computed using the TOPCOM software by Jörg Rambau, Aug 11 2011
a(12) (computed by Joswig & Kastner) from Michel Marcus, Apr 23 2018
a(13) to a(15) (computed by Froese & Renken) from Malte Renken, Jun 30 2020
STATUS
approved