Enumerative Combinatorics: Volume 2
Series: Cambridge Studies in Advanced Mathematics;
- Publisher's listprice GBP 125.00
-
59 718 Ft (56 875 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 5 972 Ft off)
- Discounted price 53 747 Ft (51 188 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
59 718 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2, Revised
- Publisher Cambridge University Press
- Date of Publication 17 August 2023
- ISBN 9781009262491
- Binding Hardback
- No. of pages800 pages
- Size 235x156x46 mm
- Weight 1230 g
- Language English 488
Categories
Short description:
Revised second volume of the standard guide to enumerative combinatorics, including the theory of symmetric functions and 159 new exercises.
MoreLong 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.
'This is one of the great books; readable, deep and full of gems. It brings algebraic combinatorics&&&160;to life. I teach out of it and feel that if I can get my students to 'touch Stanley' I have given them a gift for life.' Persi Diaconis, Stanford University
Table of Contents:
Preface to Second Edition; Preface; 5. Trees and the Composition of Generating Functions; 6. Algebraic Generating Functions; 7. Symmetric Functions; Appendices: References; Index.
More
