Enumerative Combinatorics
by Richard P. StanleySergey Fomin (Appendix by)B. Bollobas (Contribution by)W. Fulton (Contribution by)A. Katok (Contribution by)F. Kirwan (Contribution by)P. Sarnak (Contribution by)B. Simon (Contribution by)
Format: Hardcover
ISBN13: 9780521560696
Hardcover|9780521560696
✨ Featured Offer
Brand New
$219.47
List Price: $217.00
🚚
See all 1 offers from $219.47 FREE standard delivery by: 30 Mar 2026
Overview
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.
| ISBN-13 | 9780521560696 |
|---|---|
| ISBN-10 | 0521560691 |
| Weight | 2.30 Pounds |
| Dimensions | 6.00 x 1.50 x 9.00 In |
| List Price | $217.00 |
| Edition | 1st Edition |
| Format | Hardcover |
|---|---|
| Language | English |
| Pages | 600 pages |
| Publisher | Cambridge University Press |
| Published On | 1999-01-13 |
View All Offers
Sort by:
Price
Condition
Seller
Seller Comments
Price
✨ Brand New
Seller details
GridFreed
North Las Vegas, NV, USA
Size: 8x6x1; In shrink wrap. Looks like an interesting title!
Free delivery by: 30 Mar 2026