Enumerative Combinatorics: Volume 2

Contents: • Trees and the Composition of Generating Functions • Algebraic, D-Finite, and Noncommutative Generating Functions • Symmetric Functions • Knuth Equivalence, Jeu de Taquin, and the Littlewood-Richardson Rule • The Characters of GL(n, ℂ) • Index • Additional Errata and Addenda

This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions.

The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results.

Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

• Coverage of many topics not available in textbook form, plus the most accessible and thorough introduction available to the theory of symmetric functions

• Over 250 exercises with solutions or references to solutions, many of which cover previously unpublished material

• Section on Catalan numbers will appeal to amateur as well as professional mathematicians