A general theory of Wilf-equivalence for Catalan structures

zbMath1329.05006arXiv1407.8261MaRDI QIDQ907236

Mathilde Bouvel, Michael Henry Albert

Publication date: 25 January 2016

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

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

zbMATH Keywords

asymptotic enumerationCatalan numbersWilf-equivalencepattern-avoiding permutation classes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (6)

On criteria for rook equivalence of Ferrers boards ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ Two examples of Wilf-collapse ⋮ Wilf-collapse in permutation classes having two basis elements of size three ⋮ Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Dyck pattern poset
• Equipopularity classes of 132-avoiding permutations
• Non-contiguous pattern avoidance in binary trees
• Operators of equivalent sorting power and related Wilf-equivalences
• Dyck paths and pattern-avoiding matchings
• Forbidden subsequences and Chebyshev polynomials
• Restricted permutations and Chebyshev polynomials
• Pattern popularity in 132-avoiding permutations
• Equipopularity classes in the separable permutations
• Simple permutations and pattern restricted permutations
• Subclasses of the separable permutations
• Catalan Numbers
• Operators of equivalent sorting power and related Wilf-equivalences
• Restricted 132-avoiding permutations

This page was built for publication: A general theory of Wilf-equivalence for Catalan structures