Richard P. Stanley, Sergey Fomin· ISBN 9781139636193
Special offer terms
Zookal Study Premium
Subscribe & save
By selecting the 'Susbcribe & Save' option you are enrolling in an auto-renewing subscription of Zookal Study Premium. Cancel at anytime.
Auto-Renewal
Your Zookal Study Premium subscription will be renewed each month until you cancel. You consent to Zookal automatically charging your payment method on file $19.99 each month after 1st month free period until you cancel.
How to Cancel
You can cancel your subscription anytime by visiting Manage account page, clicking "Manage subscription" and completing the steps to cancel. Cancellations take effect at the end of the 1st month free period (if applicable) or at the end of the current billing cycle in which your request to cancel was received. Subscription fees are not refundable.
Zookal Study Premium Monthly Subscription Includes:
Ability to post up to ten (10) questions per month.
20% off your textbooks order and free standard shipping whenever you shop online at
textbooks.zookal.com.au
Unused monthly subscription benefits have no cash value, are not transferable, and expire at the end of each month. This means that subscription benefits do not roll over to or accumulate for use in subsequent months.
Payment Methods
Afterpay and Zip Pay will not be available for purchases with Zookal Study Premium subscription added to bag.
$1.00 preauthorisation
You may see a $1.00 preauthorisation by your bank which will disappear from your statement in a few business days..
Email communications
By adding Zookal Study Premium, you agree to receive email communications from Zookal.
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.