Abstract: We discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words, permutations, coloured permutations etc. The notion of Wilf equivalence for patterns in permutations admits a straightforward generalisation for (sets of) tree patterns; we describe classes for trees with small numbers of leaves, and give several bijections between trees avoiding pattern sets from the same class. We also explain a few general results for tree pattern avoidance, both for the exact and the asymptotic enumeration.
Recommendations
Cited in
(18)- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
- Pattern avoidance in ternary trees
- Noncontiguous pattern containment in binary trees
- Combinatorial generation via permutation languages. VI: Binary trees
- Rooted forests that avoid sets of permutations
- Pattern avoidance in forests of binary shrubs
- On the free Lie algebra with multiple brackets
- Periodicity vectors for labelled trees
- Tree series and pattern avoidance in syntax trees
- Supertrees
- Consecutive permutation patterns in trees and mappings
- Stanley-Wilf limits for patterns in rooted labeled forests
- Patterns in treeshelves
- Non-contiguous pattern avoidance in binary trees
- Consecutive pattern avoidances in non-crossing trees
- Classical and consecutive pattern avoidance in rooted forests
- Pattern avoidance in binary trees
- Wilf equivalences for patterns in rooted labeled forests
Describes a project that uses
Uses Software
This page was built for publication: Pattern avoidance in labelled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658978)
