Enumerative Combinatorics: Volume 2 (2nd Revised edition)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge Studies in Advanced Mathematics
Release date:	August 2023
Authors:	Richard Stanley
Pages:	788
Edition:	2nd Revised edition
ISBN-13:	978-1-00-926248-4
Categories:	Books
LSN:	1-00-926248-3
Barcode:	9781009262484

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!