Basket: 0 items £0.00
Submit an Enquiry or Call Us +44 (0) 1482 384660
Image for Enumerative combinatoricsVol. 2

Enumerative combinatoricsVol. 2

By: Stanley, Richard P. Fomin, Sergey(Contributions by) Fomin, Sergey(Appendix by) Bollobas, Bela(Series edited by) Fulton, W.(Series edited by) Katok, A.(Series edited by) Kirwan, F.(Series edited by) Sarnak, P.(Series edited by) Simon, B.(Series edited by) Totaro, B.(Series edited by)

Part of the Cambridge Studies in Advanced Mathematics series
0521560691 / 9780521560696
Usually dispatched within 4 weeks
24 cm xii, 581p. : ill.
research & professional  Learn More academic/professional/technical

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.


PBF Algebra, PBV Combinatorics & graph theory, UYA Mathematical theory of computation

Our price£116.00
RRP £145.00
Save 20%