Counting polygon dissections in the projective plane (Q953906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting polygon dissections in the projective plane |
scientific article; zbMATH DE number 5363187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting polygon dissections in the projective plane |
scientific article; zbMATH DE number 5363187 |
Statements
Counting polygon dissections in the projective plane (English)
0 references
6 November 2008
0 references
The number of ways to dissect a polygon in the projective plane into \(n\) subpolygons with \(k+1\) sides each is determined using generating functions. In particular, for \(k=2\) the number of triangulations of a polygon in the projective plane is determined which was first done by \textit{P.H. Edelman} and \textit{V Reiner} in [``Catalan triangulations of the Möbius band'', Graphs Comb. 13, No.\,3, 231--243 (1997; Zbl 0890.05034)]. Moreover, asymptotic estimates for the number of dissections of various kinds are obtained and probability limit laws for natural parameters associated to triangulations and dissections are determined.
0 references
polygon triangulation
0 references
polygon dissection
0 references
simplicial decomposition
0 references
projective plane
0 references
0.8921064138412476
0 references
0.8010361790657043
0 references
0.7999388575553894
0 references
0.7706227898597717
0 references
0.7695131897926331
0 references
