Classical and consecutive pattern avoidance in rooted forests
From MaRDI portal
Publication:2102695
DOI10.1016/j.jcta.2022.105699zbMath1502.05004arXiv2005.08889OpenAlexW3025292272MaRDI QIDQ2102695
Publication date: 29 November 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.08889
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)
Related Items (2)
Wilf equivalences for patterns in rooted labeled forests ⋮ Stanley-Wilf limits for patterns in rooted labeled forests
Uses Software
Cites Work
- Unnamed Item
- Pattern avoidance in poset permutations
- Pattern avoidance in binary trees
- Consecutive patterns in permutations
- Counting 1324-avoiding permutations
- A new class of Wilf-equivalent permutations
- Wilf equivalence relations for consecutive patterns
- Rooted forests that avoid sets of permutations
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Dyck tilings, increasing trees, descents, and inversions
- Wilf-equivalence for singleton classes
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- Increasing trees and alternating permutations
- Restricted permutations
This page was built for publication: Classical and consecutive pattern avoidance in rooted forests
