摘要
The main concern of this paper is with a bijective approach to various classes ofincreasing trees. We discover an increasing tree counterpart of the decomposition algorithmfor Schroder trees. This bijection has probably reached its full generality for decomposingincreasing trees. As a special case of our algorithm, we provide a solution to a problemconcerning the enumeration of plane trees by the net number of inversions.
The main concern of this paper is with a bijective approach to various classes ofincreasing trees. We discover an increasing tree counterpart of the decomposition algorithmfor Schroder trees. This bijection has probably reached its full generality for decomposingincreasing trees. As a special case of our algorithm, we provide a solution to a problemconcerning the enumeration of plane trees by the net number of inversions.
