Wilf equivalences for patterns in rooted labeled forests

DOI10.1016/j.aam.2024.102675arXiv2007.12690OpenAlexW4392432478MaRDI QIDQ6118359

Michael S. Ren

Publication date: 21 March 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

c-forest-Wilf equivalence classesforest Simion-Schmidt bijection

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Pattern avoidance in poset permutations
• A spectral approach to consecutive pattern-avoiding permutations
• Patterns in permutations and words.
• Pattern avoidance in binary trees
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Consecutive patterns in 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
• Classical and consecutive pattern avoidance in rooted forests
• Wilf-equivalence for singleton classes
• Pattern avoidance in forests of binary shrubs
• A survey of consecutive patterns in permutations
• Generalized permutation patterns -- a short survey
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• Restricted permutations

This page was built for publication: Wilf equivalences for patterns in rooted labeled forests