Contents

Ars Combinatoria

  • Research article

Noncrossing Matchings with Fixed Points

Weiming Weng1, Bolian Liu2
1Department of Computer Science, Guangdong Polytechnic Normal University Guangzhou 510665, P. R. China,
2School of Mathematical Sciences, South China Normal University Guangzhou 510631, P. R. China
  • Published: 30/04/2013

Abstract

The noncrossing matchings with each of their blocks containing a given element are introduced and studied. The enumeration of these matchings is described through a polynomial of several variables, which is proved to satisfy a recursive formula. Results of the enumeration of noncrossing matchings with fixed points are connected with Catalan numbers.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Weiming Weng, Bolian Liu. Noncrossing Matchings with Fixed Points[J], Ars Combinatoria, Volume 109. 161-170. .