Matchings avoiding partial patterns

MaRDI QIDQ870038zbMATHFDO

Authors William Y. C. Chen, Toufik Mansour, Sherry H. F. Yan

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0504342

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

oscillating tableauxsuper-Catalan numbersSchröder numbersSchröder paths

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Abstract: We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a bijection between Schr"oder paths without peaks at level one and matchings avoiding both patterns 12312 and 121323. Such objects are counted by the super-Catalan numbers or the little Schr"{o}der numbers. A refinement of the super-Catalan numbers is obtained by fixing the number of crossings in the matchings. In the sense of Wilf-equivalence, we find that the patterns 12132, 12123, 12321, 12231, 12213 are equivalent to 12312.

Recommendations

• Matchings avoiding partial patterns and lattice paths
• Pattern avoidance in matchings and partitions
• Partial matchings and pattern avoidance
• Matchings and partial patterns
• Patterns in matchings and rook placements

Cited in

(12)

• A general theory of Wilf-equivalence for Catalan structures
• Pattern avoidance in matchings and partitions
• Partial matchings and pattern avoidance
• Partitions and partial matchings avoiding neighbor patterns
• Matchings and partial patterns
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Matchings avoiding partial patterns and lattice paths
• Finitely labeled generating trees and restricted permutations
• On pattern avoidance in matchings and involutions
• Matchings In Three Catalan Lattices
• Patterns in matchings and rook placements
• Reduced decompositions of matchings

This page was built for publication: Matchings avoiding partial patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870038)