Enumerative Combinatorics: Volume 2
Series: Cambridge Studies in Advanced Mathematics; 62;
- Publisher's listprice GBP 49.99
-
23 882 Ft (22 745 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. 2 388 Ft off)
- Discounted price 21 494 Ft (20 471 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
23 882 Ft
Availability
Out of print
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 New ed
- Publisher Cambridge University Press
- Date of Publication 4 June 2001
- ISBN 9780521789875
- Binding Paperback
- No. of pages600 pages
- Size 229x152x38 mm
- Weight 880 g
- Language English 0
Categories
Short description:
An introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.
MoreLong description:
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.
'This magnificent two-volume work is best described by a quote from Gian-Carlo Rota's Forward to Volume 2: I find it impossible to predict when Richard Stanley's two-volume exposition of combinatorics may be superseded. No one will dare try, let alone be able, to match the thoroughness of coverage, the care for detail, the definitiveness of proof, the elegance of presentation.' J. E. Graver
Table of Contents:
5. Composition of generating functions; 6. Algebraic, D
-finite, and noncommutative generating functions; 7. Symmetric functions; Appendix Sergey Fomin.
Enumerative Combinatorics: Volume 2
23 882 HUF
21 494 HUF
Integrated Process Design and Operational Optimization Via Multiparametric Programming
44 793 HUF
41 210 HUF
Scalable Processing of Spatial-Keyword Queries
31 521 HUF
28 999 HUF
