Pattern avoidance in labelled trees

Details Pattern avoidance in labelled trees Pattern avoidance in labelled trees

2011-10-04

arxiv.org/abs/1110.0844v4

S\'eminaire Lotharingien de Combinatoire, B67b (2012), 27 pp

Mathematics

Combinatorics

27 pages, corrected various misprints, added an appendix explaining the operadic context

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pattern avoidance in labelled trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern avoidance in labelled trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern avoidance in labelled trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324305