Consecutive pattern avoidances in non-crossing trees

DOI10.1007/S00373-010-0950-9MaRDI QIDQ607683zbMATH OpenOpenAlexFDO

Authors Yidong Sun, Zhiping Wang

Publication date 3 December 2010

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0950-9

zbMATH Keywords

Catalan numbernon-crossing treepattern avoidanceSchröder path

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

Recommendations

• String pattern avoidance in generalized non-crossing trees
• Non-contiguous pattern avoidance in binary trees
• Pattern avoidance in labelled trees
• Pattern avoidance in binary trees
• Pattern avoidance in ternary trees

Cites work

• 2-binary trees: bijections and related issues
• Analytic combinatorics of non-crossing configurations
• Bijections for ternary trees and non-crossing trees
• Consecutive patterns in permutations
• Descents in noncrossing trees
• Enumeration of noncrossing trees on a circle
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Noncrossing trees and noncrossing graphs
• Permutations and words counted by consecutive patterns
• Restricted permutations
• Statistics on non-crossing trees
• String pattern avoidance in generalized non-crossing trees
• The patterns of permutations

Cited in

(10)

• A refinement of leaves on noncrossing trees
• Decomposition and merging algorithms for noncrossing forests
• Classical and consecutive pattern avoidance in rooted forests
• Noncontiguous pattern containment in binary trees
• String pattern avoidance in generalized non-crossing trees
• A decomposition algorithm for noncrossing trees
• Non-contiguous pattern avoidance in binary trees
• Pattern avoidance in ternary trees
• Five classes of pattern avoiding inversion sequences under one roof: generating trees
• Pattern avoidance in binary trees

This page was built for publication: Consecutive pattern avoidances in non-crossing trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607683)