一类标号三叉树及其推广(英文)A Subclass of Labeled Ternary Trees and Its Generalization
侯江霞
摘要(Abstract)：
Brain Drake所研究的一类三叉树的计数问题是和Catalan数有关的一个组合问题.本文给出了这个问题的一个一一映射和一个半组合的证明,接着用对称函数的方法对这类标号树问题给予推广.
关键词(KeyWords)： 标号三叉树;生成函数;Catalan数
基金项目(Foundation): Supported by NSFC(11261059)and XJEDU(2010S01)
作者(Author): 侯江霞
参考文献(References)：
- [1]Gessel I M.Generatin functions and enumeration of sequences[D].Boston:Massachusetts Institute of Technology,1977.
- [2]Goulden I P,Pepper S.Labeled trees and factorizations of a cycle into transpositions[J].Discrete Mathematics,1993,113:263-268.
- [3]Postnikov A.Intransitive trees[J].Journal of Combinatorial Theory(Series A),1997,79:360-366.
- [4]Prodinger H.A simple bijection between a subclass of2-binary trees and ternary trees[J].Discrete Mathematics,2009,309:959-961.
- [5]Stanley R.Enumeration of combinatorics Vol.2[M].Cambridge:Cambridge University Press,1999.
- [6]Drake B.An inversion theorem for labeled trees and some limits of areas under lattice paths[D].Brandeis:Brandeis University,2008.