Stanley-Wilf limits for patterns in rooted labeled forests

DOI10.1016/j.ejc.2023.103858arXiv2310.02499OpenAlexW4387424015MaRDI QIDQ6146494

Michael S. Ren

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pattern avoidanceenumerative combinatoricsrooted forestscluster methodforest-Young diagram

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern avoidance in poset permutations
• A spectral approach to consecutive pattern-avoiding permutations
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Pattern avoidance in binary trees
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• The cycle structure of random permutations
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Rooted forests that avoid sets of permutations
• On growth rates of closed permutation classes
• Classical and consecutive pattern avoidance in rooted forests
• A survey of consecutive patterns in permutations
• Generalized permutation patterns -- a short survey
• Stirling Behavior is Asymptotically Normal

This page was built for publication: Stanley-Wilf limits for patterns in rooted labeled forests