Enumerative Combinatorics: Volume 2

Richard P. Stanley

Jan 1999 · Cambridge Studies in Advanced Mathematics Book 62 · Cambridge University Press

About this eBook

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.

Ratings and reviews

I have taken this course with Professor Richard Stanley at the University of Miami and it's clear he has written "the book" on this subject. The presentation is clear and concise. The 4/5 stars comes from the fact that this edition is formatted terribly for e-reading.