Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact email@example.com 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
'This magnificent two-volume work is best described by a quote from Gian-Carlo Rota's Forward to Volume 2: I find it impossible to predict when Richard Stanley's two-volume exposition of combinatorics may be superseded. No one will dare try, let alone be able, to match the thoroughness of coverage, the care for detail, the definitiveness of proof, the elegance of presentation.' J. E. GraverSee more reviews
'As a researcher, Stanley has few peers in combinatorics; as at once, to pack every page with information, connect with the reader's intuition, and communicate the underlying, unifying philosophy of the subject.' D. V. Feldman, University of New Hampshire
'What else is to be added to our comments on this excellent book? Perhaps a quotation from G.-C. Rota's foreword: 'Every once in a long while, a textbook worthy of the name comes along … Weber, Bertini, van der Waerden, Feller, Dunford and Schwartz, Ahlfors, Stanley.' European Mathematical Society
'… an authoritative account of enumerative combinatorics.' George E. Andrews, Bulletin of the London Mathematical Society
'What else can be added to the comments upon this excellent book?' EMS Newsletter
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 firstname.lastname@example.orgRegister 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 ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×