本书介绍了生成函数组合、树、代数生成函数、D有限生成函数、非交换生成函数和对称函数。关于对称函数的论述只适用于研究生的入门课程并着重于组合学方面，尤其是Robinson-Schensted-Knuth算法，还讨论了对称函数与表示论之间的联系。附录（由Sergey Fomin编写）中更深入地讨论了对称函数理论，包括jeu de taquin和Littlewood-richardson规则。另外，书中包含大量习题，并附有参考答案。
本书是两卷集计数组合学基础导论中的第2卷，适合于研究生和数学研究人员。

Foreword
Preface
Notation
5 Trees and the Composition of Generating Functions
5.1 The Exponential Formula
5.2 Applications of the Exponential Formula
5.3 Enumeration of Trees
5.4 The Lagrange Inversion Formula
5.5 Exponential structures
5.6 Oriented Trees and the Matrix-Tree Theorem
Notes
References
Exercises
Solutions to Exercises
6 Algebraic,D-Finite,and Noncommutative Generating Functions
6.1 Algebraic Generaing Functions
6.2 Eexamples of Algebraic Series
6.3 Diagonals
6.4 D-Finite Generating Functions
6.5 Noncommutative Generating Functions
6.6 Algebric Formal Series
6.7 Noncommutative Diagonals
Notes
References
Exercises
Solutions to Exercises
7 Symmetric Functions
……
A 1 Knuth Equivalence,Jeu de Taquin,and the Littlewood-Richardson Rule
A 2 The Characters of GL
Index
Additional Errata and Addenda