A Refinement of Leaves on Noncrossing Trees

作者:Pang Sabrina X M; Lv Lun*
来源:Graphs and Combinatorics, 2013, 29(1): 131-143.
DOI:10.1007/s00373-011-1097-z

摘要

A leaf of a NC-tree is called a left leaf if it has a label less than that of its parent, and it is called a right leaf otherwise. We enumerate NC-trees with given number of left leaves and right leaves. As an application, the combinatorial interpretation of three identities is obtained. By extending a well-known involution on plane trees to NC-trees, we derive that the two parameters, the number of left leaves and the number of non-root proper vertices, have a symmetric joint distribution in the NC-trees. Finally, a bijection between right leaves and NC-forests is also presented.

全文