A Decomposition Algorithm for Noncrossing Trees

[摘要] Based on the classic bijective algorithm for trees due to Chen, we present a decomposition algorithm for noncrossing trees. This leads to a combinatorial interpretation of a formula on noncrossing trees of size $n$ with $k$ descents. We also derive the fo

[学科分类] 离散数学和组合数学

[关键词] noncrossing tree;descent;bijection