A decomposition algorithm for noncrossing trees
The electronic journal of combinatorics, Tome 21 (2014) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 formula for noncrossing trees of size $n$ with $k$ descents and $i$ leaves, which is a refinement of the formula given by Flajolet and Noy. As an application of our algorithm, we answer a question proposed by Hough, which asks for a bijection between two classes of noncrossing trees with a given number of descents.
DOI : 10.37236/3353
Classification : 05C85, 05C05, 05C30, 05A15
Mots-clés : noncrossing tree, descent, bijection
@article{10_37236_3353,
     author = {Lun Lv and Sabrina X.M. Pang},
     title = {A decomposition algorithm for noncrossing trees},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {1},
     doi = {10.37236/3353},
     zbl = {1300.05302},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3353/}
}
TY  - JOUR
AU  - Lun Lv
AU  - Sabrina X.M. Pang
TI  - A decomposition algorithm for noncrossing trees
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3353/
DO  - 10.37236/3353
ID  - 10_37236_3353
ER  - 
%0 Journal Article
%A Lun Lv
%A Sabrina X.M. Pang
%T A decomposition algorithm for noncrossing trees
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/3353/
%R 10.37236/3353
%F 10_37236_3353
Lun Lv; Sabrina X.M. Pang. A decomposition algorithm for noncrossing trees. The electronic journal of combinatorics, Tome 21 (2014) no. 1. doi: 10.37236/3353

Cité par Sources :