文摘
英文文摘
声明
Chapter 1 Introduction
1.1 Generalized Catalan Sequences
1.2 Fibonacci-like Sequences
Chapter 2 Convolution (1.2) and Counting Ordered Trees
2.1 Notations and Lagrange Inversion Formula
2.2 Deduction of (1.2) from Lagrange Inversion Formula
2.3 Enumeration of κ-ary Trees and Chen's Bijective Algorithm
Chapter 3 κ-ary Trees and the Gould-Vandermonde's Convolution
3.1 Combinatorial Sums Involving the Generalized Catalan Numbers
3.2 An Involution on Colored Trees
3.3 Refinement of Cβγ(n) and the Gould-Vandermonde's Convolution
3.4 Congruence Results of the Generalized Catalan Numbers
Chapter 4 Skinny Trees and Fibonacci-like Sequences
4.1 A Short Introduction
4.2 Sequences with Go = 1, G1 = 1
4.3 Sequences with Go = 1, G1 =d
4.4 Average Height of Skinny Trees
Bibliography
Acknowledge
Resume
南开大学;