Pattern avoidance in matchings and partitions

zbMath1267.05021arXiv1211.3442MaRDI QIDQ1953480

Yanyan Li

Publication date: 7 June 2013

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

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

zbMATH Keywords

matchingsbijectionset partitionsDyck pathspatternsshape-Wilf-equivalence3-crossings3-nestingsarc diagram representaionfull rook placements

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (13)

On pattern avoidance in matchings and involutions ⋮ Counting with Borel's triangle ⋮ Pattern avoidance in poset permutations ⋮ Partial permutations avoiding pairs of patterns ⋮ Pattern avoidance and dominating compositions ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ An infinite family of inv-Wilf-equivalent permutation pairs ⋮ A Fuss-type family of positive definite sequences ⋮ A note on statistical averages for oscillating tableaux ⋮ Generating permutations with restricted containers ⋮ Polynomiality of certain average weights for oscillating tableaux ⋮ Rook and Wilf equivalence of integer partitions ⋮ Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generating tree approach to \(k\)-nonnesting partitions and permutations
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
• Bijections for refined restricted permutations
• Matchings and partial patterns
• On partitions avoiding 3-crossings
• Dyck paths and pattern-avoiding matchings
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Avoidance of partitions of a three-element set
• Enumeration of \((k,2)\)-noncrossing partitions
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
• Shape-Wilf-ordering on permutations of length 3
• On pattern-avoiding partitions
• Standard Young tableaux of height 4 and 5
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• A new class of Wilf-equivalent permutations
• On \(abab\)-free and \(abba\)-free set partitions
• On multiple pattern avoiding set partitions
• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Wilf-equivalence for singleton classes
• Walks with small steps in the quarter plane
• Longest Increasing and Decreasing Subsequences
• Crossings and nestings of matchings and partitions
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• A Census of Planar Maps
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• Permutations with restricted patterns and Dyck paths

This page was built for publication: Pattern avoidance in matchings and partitions