Abstract
We say that an unordered rooted labeled forest avoids the pattern π∈Sn if the sequence obtained from the labels along the path from the root to any vertex does not contain a subsequence that is in the same relative order as π. We enumerate several classes of forests that avoid certain sets of permutations, including the set of unimodal forests, via bijections with set partitions with certain properties. We also define and investigate an analog of Wilf equivalence for forests.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call