The number of triangulations of the cyclic polytope C(n,n-4)

DOI10.1007/S00454-001-0050-YMaRDI QIDQ1349285zbMATH OpenOpenAlexFDO

Authors Miguel Azaola, Francisco Santos

Publication date 21 May 2002

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-001-0050-y

zbMATH Keywords

chamber complexcyclic polytopeGale transformnumber of triangulationsvirtual chamber

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Oriented matroids in discrete geometry (52C40)

Review text

In this paper the exact number of triangulations of the cyclic polytope \(C(n,n-4)\) is determined. For even \(n\) this number is \((n+4)2^{(n- 4)/2}- n\), for odd \(n\) it is slightly different. The method is based on Gale duality and oriented matroid theory. The concept of a virtual chamber is used which was introduced by \textit{J. A. de Loera} et al. [Doc. Math. J. DMV 1, 103--119 (1996; Zbl 0852.52007)]. Furthermore the paper contains results on the maximum number of regular triangulations.

Recommendations

• The generalized Baues problem for cyclic polytopes. I
• On counting the k-face cells of cyclic arrangements
• New counts for the number of triangulations of cyclic polytopes
• Triangulations of cyclic polytopes
• New combinatorial descriptions of the triangulations of cyclic polytopes and the second higher Stasheff--Tamari posets

Cited in

(8)

• How many cyclic subpolytopes can a non-cyclic polytope have?
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• New counts for the number of triangulations of cyclic polytopes
• Persistent graphs and cyclic polytope triangulations
• New interpretations of the higher Stasheff-Tamari orders
• On counting the k-face cells of cyclic arrangements
• Studying triangulations of even-dimensional cyclic polytopes via directed graphs
• Associahedra minimize f-vectors of secondary polytopes of planar point sets

This page was built for publication: The number of triangulations of the cyclic polytope \(C(n,n-4)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349285)