Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- 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
Reviews & endorsements
"...sure to become a standard as an introductory graduate text in combinatorics."
Bulletin of the AMS"See more reviews
"As a researcher, Stanley has few peers in combinatorics...the trove of exercises with solutions will form a vital resource; indeed, exercise 6.19 on the Catalan numbers, in 66 (!) parts, justifies the investment by itself. Both volumes highly recommended for all libraries."
"Volume 2 not only lives up to the high standards set by Volume 1, but surpasses them... Stanley's book is a valuable contribution to enumerative combinatorics. Beginners will find it an accessible introduction to the subject, and experts will still find much to learn from it."
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: June 2001
- format: Paperback
- isbn: 9780521789875
- length: 600 pages
- dimensions: 229 x 152 x 38 mm
- weight: 0.88kg
- availability: Available
Table of Contents
5. Composition of generating functions
6. Algebraic, D-finite, and noncommutative generating functions
7. Symmetric functions
Appendix Sergey Fomin.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×