Noncontiguous pattern containment in binary trees

DOI10.1155/2014/316535zbMath1288.05127OpenAlexW2038839107WikidataQ59047266 ScholiaQ59047266MaRDI QIDQ2449274

Tyler Schrock, Connor Scholten, Alexa Serrato, Lara K. Pudwell

Publication date: 7 May 2014

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/316535

zbMATH Keywords

enumeration of binary trees

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)

Related Items

Supertrees

Uses Software

• OEIS
• BinaryTrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surprising symmetries in objects counted by Catalan numbers
• Non-contiguous pattern avoidance in binary trees
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Pattern avoidance in labelled trees
• Pattern avoidance in binary trees
• Stack sortable permutations
• Sorted and/or sortable permutations
• On generating series of finitely presented operads
• A unification of permutation patterns related to Schubert varieties
• The absence of a pattern and the number of occurrences of another
• Patterns and pattern-matching in trees: An analysis
• Generation of Binary Trees from Ballot Sequences
• Pattern Avoidance in Ternary Trees