Annular non-crossing matchings
From MaRDI portal
Publication:2808553
Abstract: It is well known that the number of distinct non-crossing matchings of half-circles in the half-plane with endpoints on the x-axis equals the Catalan number . This paper generalizes that notion of linear non-crossing matchings, as well as the circular non-crossings matchings of Goldbach and Tijdeman, to non-crossings matchings of line segments embedded within an annulus. We prove that the number of such matchings with exterior endpoints and interior endpoints correspond to an entirely new, one-parameter generalization of the Catalan numbers with . We also develop bijections between specific classes of annular non-crossing matchings and other combinatorial objects such as binary combinatorial necklaces and planar graphs. Finally, we use Burnside's Lemma to obtain an explicit formula for for all .
Recommendations
- Noncrossing matchings with fixed points
- Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
- On the enumeration of non-crossing pairings of well-balanced binary strings
- Crossings and nestings of matchings and partitions
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
Cited in
(4)
This page was built for publication: Annular non-crossing matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808553)