Annular non-crossing matchings

From MaRDI portal
Publication:2808553




Abstract: It is well known that the number of distinct non-crossing matchings of n half-circles in the half-plane with endpoints on the x-axis equals the nth Catalan number Cn. 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 n line segments embedded within an annulus. We prove that the number of such matchings vertAnn(n,m)vert with n exterior endpoints and m interior endpoints correspond to an entirely new, one-parameter generalization of the Catalan numbers with Cn=vertAnn(1,m)vert. 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 vertAnn(n,m)vert for all n,mgeq0.





Describes a project that uses

Uses Software





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)