Consecutive pattern avoidances in non-crossing trees

DOI10.1007/s00373-010-0950-9zbMath1228.05041OpenAlexW2067442553MaRDI QIDQ607683

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 numberpattern avoidanceSchröder pathnon-crossing tree

Mathematics Subject Classification ID

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

Related Items

A decomposition algorithm for noncrossing trees ⋮ A refinement of leaves on noncrossing trees ⋮ Decomposition and merging algorithms for noncrossing forests

Cites Work

• Unnamed Item
• Permutations and words counted by consecutive patterns
• Analytic combinatorics of non-crossing configurations
• Enumeration of noncrossing trees on a circle
• Consecutive patterns in permutations
• Descents in noncrossing trees
• Bijections for ternary trees and non-crossing trees
• Statistics on non-crossing trees
• The patterns of permutations
• 2-binary trees: bijections and related issues
• Noncrossing trees and noncrossing graphs
• Pattern Avoidance in Generalized Non-crossing Trees
• Restricted permutations