The number of triangulations of the cyclic polytope \(C(n,n-4)\) (Q1349285)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1743173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of triangulations of the cyclic polytope \(C(n,n-4)\) |
scientific article; zbMATH DE number 1743173 |
Statements
The number of triangulations of the cyclic polytope \(C(n,n-4)\) (English)
0 references
21 May 2002
0 references
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.
0 references
virtual chamber
0 references
chamber complex
0 references
Gale transform
0 references
number of triangulations
0 references
cyclic polytope
0 references
0.7896549701690674
0 references
0.7896549701690674
0 references
0.7810261845588684
0 references
0.7723259925842285
0 references
