Combinatorial Counting (Volume 2) (English Edition)

Author: (USA) Stanley (Stanley/R.P.)
Publisher:
Publish Date: 2004-11-01
Features: This book introduces generating function combinations, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The discussion on symmetric functions is suitable for introductory graduate courses and focuses on combinatorics, particularly the Robinson-Schensted-Knuth algorithm, and also discusses the connection between symmetric functions and representation theory. The appendix (written by Sergey Fomin) provides a deeper exploration of symmetric function theory, including jeu de taquin and Littlewood-Richardson rules. Additionally, the book contains numerous exercises with reference answers. This book is the second volume of the two-volume introduction to the fundamentals of enumerative combinatorics, suitable for graduate students and mathematicians.