Decomposition and merging algorithms for noncrossing forests

DOI10.1007/s00373-021-02415-5zbMath1479.05011OpenAlexW4200165249MaRDI QIDQ2062886

Lun Lv, Sabrina X. M. Pang, Xiaoming Deng

Publication date: 3 January 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02415-5

zbMATH Keywords

bijectioncomponentdecomposition algorithmmerging algorithmnoncrossing forest

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Uses Software

• OEIS

Cites Work

• A decomposition algorithm for noncrossing trees
• The cyclic sieving phenomenon for non-crossing forests
• Consecutive pattern avoidances in non-crossing trees
• Dyck paths with coloured ascents
• Analytic combinatorics of non-crossing configurations
• Enumeration of noncrossing trees on a circle
• Descents in noncrossing trees
• Bijections for ternary trees and non-crossing trees
• Statistics on non-crossing trees
• Noncrossing trees and noncrossing graphs
• A general bijective algorithm for trees.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition and merging algorithms for noncrossing forests