A GNERAL BIJECTIVE ALGORITHM FOR INCREASING TREES  

A GENERAL BIJECTIVE ALGORITHM FOR INCREASING TREES

作　　者：(Dedicated to Professor Wu Wentsun on the occasion of his 80-th birthday)William Y. C. CHEN(Center for Combinatorics, Nankai University, Tianjin 300071, Chinaand T-7, Mail Stop B 284, Los Alamos National Laboratory,Los Alamos, New Mexico 87545, USA) 

出　　处：《Systems Science and Mathematical Sciences》1999年第3期193-203,共11页

摘　　要：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.

关 键 词：INCREASING trees Schroder trees BIJECTIONS 

分 类 号：O157[理学—数学]