More titles to consider

Shopping Cart

You're getting the VIP treatment!

With the purchase of Kobo VIP Membership, you're getting 10% off and 2x Kobo Super Points on eligible items.

Item(s) unavailable for purchase
Please review your cart. You can remove the unavailable item(s) now or we'll automatically remove it at Checkout.


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.

Ratings and Reviews

Overall rating

No ratings yet
5 Stars 4 Stars 3 Stars 2 Stars 1 Stars
0 0 0 0 0

Be the first to rate and review this book!

You've already shared your review for this item. Thanks!

We are currently reviewing your submission. Thanks!


You can read this item using any of the following Kobo apps and devices:

  • IOS