Pattern avoidance in binary trees

DOI10.1016/j.jcta.2010.03.004zbMath1221.05058arXiv0809.0488OpenAlexW2051725919WikidataQ60692214 ScholiaQ60692214MaRDI QIDQ986111

Eric S. Rowland

Publication date: 11 August 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

binary treespattern avoidancealgebraic generating functionsWilf equivalenceDyck words

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Geometric properties of matrices induced by pattern avoidance ⋮ On coincidences of tuples in a binary tree with random labels of vertices ⋮ The Dyck pattern poset ⋮ Wilf equivalences for patterns in rooted labeled forests ⋮ Tree series and pattern avoidance in syntax trees ⋮ Consecutive patterns in Catalan words and the descent distribution ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ Unnamed Item ⋮ Rooted forests that avoid sets of permutations ⋮ On the sub-permutations of pattern avoiding permutations ⋮ Noncontiguous pattern containment in binary trees ⋮ On coincidences of tuples in a \(q\)-ary tree with random labels of vertices ⋮ On generating series of finitely presented operads ⋮ Modular Catalan numbers ⋮ Quotients of the Magmatic Operad: Lattice Structures and Convergent Rewrite Systems ⋮ BinaryTrees ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset ⋮ Classical and consecutive pattern avoidance in rooted forests ⋮ Automatic congruences for diagonals of rational functions

Uses Software

• OEIS
• TreePatterns
• Singular

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dyck path enumeration
• \textsc{IntegerSequences}: a package for computing with \(k\)-regular sequences
• Counting strings in Dyck paths
• Patterns and pattern-matching in trees: An analysis
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• The Goulden—Jackson cluster method: extensions, applications and implementations
• The On-Line Encyclopedia of Integer Sequences
• Motzkin numbers