文摘
英文文摘
南开大学学位论文版权使用授权书和原创性声明
Introduction
Chapter 1 Definitions and Preliminaries
1.1 Permutations and Partitions
1.2 Matchings
1.3 Lattice Paths
1.4 The RSK Algorithm
1.5 Noncrossing Partitions and RNA Secondary Structures
1.6 Nonnesting Partitions and Shi Arrangement
1.7 Catalan Number and Binary Trees
Chapter 2 Reduction of m-Regular Noncrossing Partitions
2.1 Introduction
2.2 The Reduction Algorithm
2.3 Reduction of Noncrossing Partitions
Chapter 3 Labelling Schemes for Dyck paths and 2-Motzkin paths
3.1 Introduction and Notations
3.2 Labelling Schemes for Dyck paths
3.2.1 321-Avoiding Labelling Scheme for Dyck Paths
3.2.2 312-Avoiding Labelling Scheme for Dyck Paths
3.2.3 Other Labelling Schemes for Dyck Paths
3.3 Labelling Schemes for 2-Motzkin paths
3.4 2-Regular Nonnesting (abba-Free) Partitions
Chapter 4 Matchings and Pairs of Noncrossing Dyck Paths
4.1 Introduction
4.2 3-Noncrossing Matchings
4.3 3-Nonnesting Matchings
4.4 Non-double-nesting Matchings
4.5 Concluding Remarks
Chapter 5 Crossings and Nestings of Matchings and Partitions
5.1 Introduction
5.2 A Bijection between Set Partitions and Vacillating Tableaux
5.3 Crossings and Nestings of Partitions
5.4 A Variant: Partitions and Hesitating Tableaux
5.5 Enumeration of k-Noncrossing Matchings
Chapter 6 (k, m)-Catalan Numbers and Hook Length Polynomials for Trees
6.1 Introduction
6.2 (k, m)-Parking Tables and (k, m)-ary Trees
6.3 Hook Length Polynomials for m-ary Trees
6.4 Hook Length Polynomials for Plane Forests
Bibliography
Acknowledgements