Enumerative Combinatorics: Volume 2 An introduction, suitable for beginning graduate students, showing connections to other areas of mathematics. Richard P. Stanley (Author), Sergey Fomin (Appendix by) 9780521789875, Cambridge University Press Paperback, published 4 June 2001 600 pages22.9 x 15.2 x 3.8 cm, 0.88 kg 'What else can be added to the comments upon this excellent book?' EMS Newsletter 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. 5. Composition of generating functions 6. Algebraic, D-finite, and noncommutative generating functions 7. Symmetric functions Appendix Sergey Fomin. Subject Areas: Mathematical theory of computation [UYA], Combinatorics & graph theory [PBV], Algebra [PBF]
