Description: Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and 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 and focusing on combinatorics, especially the Robinson–Schensted–Knuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the Littlewood–Richardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.
Price: 66.82 USD
Location: Matraville, NSW
End Time: 2024-12-02T05:59:09.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 60 Days
Refund will be given as: Money Back
EAN: 9781009262484
UPC: 9781009262484
ISBN: 9781009262484
MPN: N/A
Item Weight: 0.75 kg
Number of Pages: 788 Pages
Language: English
Publication Name: Enumerative Combinatorics: Volume 2
Publisher: Cambridge University Press
Item Height: 1.6 in
Publication Year: 2023
Subject: Discrete Mathematics
Features: Revised
Type: Textbook
Author: Richard Stanley
Item Length: 9 in
Subject Area: Mathematics
Item Width: 6 in
Series: Cambridge Studies in Advanced Mathematics Ser.
Format: Trade Paperback
