The two-volume essential guide for the combinatorial enumeration by Richard Stanley has become the thematic standard for students and experts. This fully revisited second edition of volume two covers the synthesis of generating functions, specifically the exponential formula and the Lagrange inversion formula, labeled and unlabeled trees, algebraic, D-finite, and non-regular generating functions, as well as symmetric functions. The chapter on symmetric functions provides the only available presentation of the subject suitable for an introductory graduate course focusing on combinatorial enumeration, specifically the Robinson–Schensted–Knuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including the jeu de taquin and the Littlewood–Richardson rule. The exercises in the book play a vital role in material development, and this second edition includes more than 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.
Manufacturer
- Publisher
- Cambridge University Press
- Type
- Mathematics of Positive Sciences
- Language
- English
- Subtitle
- -
- Cover
- Soft
- Number of Pages
- -
- Release Date
- -
- Publication Date
- -
- Dimensions
- -
- ISBN-13
- 9781009262484
Important information
Specifications are collected from official manufacturer websites. Please verify the specifications before proceeding with your final purchase. If you notice any problem you can report it here.