A refinement for ordered labeled trees

초록

Let On be the set of ordered labeled trees on {0; : : : ; n}. A maximal decreasing subtree of an ordered labeled tree is de ned by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new re nement On;k of On,which is the set of ordered labeled trees whose maximal decreasing subtree has k + 1 vertices.

키워드