Dyck paths and pattern-avoiding matchings

Abstract

How many matchings on the vertex set V={1,2,...,2n} avoid a given configuration of three edges? Chen, Deng and Du have shown that the number of matchings that avoid three nesting edges is equal to the number of matchings avoiding three pairwise crossing edges. In this paper, we consider other forbidden configurations of size three. We present a bijection between matchings avoiding three crossing edges and matchings avoiding an edge nested below two crossing edges. This bijection uses non-crossing pairs of Dyck paths of length 2n as an intermediate step. Apart from that, we give a bijection that maps matchings avoiding two nested edges crossed by a third edge onto the matchings avoiding all configurations from an infinite family, which contains the configuration consisting of three crossing edges. We use this bijection to show that for matchings of size n>3, it is easier to avoid three crossing edges than to avoid two nested edges crossed by a third edge. In this updated version of this paper, we add new references to papers that have obtained analogous results in a different context.

18 pages, 4 figures, important references added

Cited by in corpus (10)

• The combinatorics of associated Hermite polynomials
• Pattern avoidance in matchings and partitions
• On identities concerning the numbers of crossings and nestings of two edges in matchings
• On pattern avoidance in matchings and involutions
• Endhered patterns in matchings and RNA
• Pattern avoidance in the matching pattern poset
• k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
• Fillings of skew shapes avoiding diagonal patterns
• Counting with Borel's Triangle
• Pattern avoidance in partial permutations