A GENERAL BIJECTIVE ALGORITHM FORI NCREASING TREES Dedicated to Professor Wu Wentsün on the occasion

• 作 者: William Y. C. CHEN
• 机 构: Center for Combinatorics, Nankai University,Tianjin 300071, China and T-7, Mail Stop B 284,Los Alamo
• 出 处: 系统科学与数学（英文期刊）
• 发表日期: 1999年3期
• 关键词: Increasing trees Schrder trees bijections

The main conc of this paper is with a bijective approachto various classes of increasing trees. We discoveran increasing tree counterpart of the decomposition algorithmfor Schrder trees. This bijection has probably reached itsfull generality for decomposing increasing trees.As a special case of our algorithm, we providea solution to a problem concingthe enumeration of plane trees by the net number of inversions.