Counting polygon dissections in the projective plane
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.
- Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
- A bijective proof of Macdonald's reduced word formula
- Regular dissections of an infinite strip
- Closed forms for the number of polygon dissections
- Brown's theorem and its application for enumeration of dissections and planar trees
- Polygon dissections in the projective plane
- Counting symmetry classes of dissections of a convex regular polygon
- scientific article; zbMATH DE number 6756979 (Why is no real title available?)
- Enumerating simplicial decompositions of surfaces with boundaries
- Enumeration and limit laws of dissections on a cylinder
This page was built for publication: Counting polygon dissections in the projective plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953906)