Enumerative Combinatorics: Volume 2

Enumerative combinatorics is a branch of mathematics that studies the enumeration of combinatorial structures, such as permutations, combinations, and graphs. Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This revised second edition covers generating functions, labeled and unlabeled trees, algebraic, D-finite, and noncommutative generating functions, and symmetric functions. It also includes over 400 exercises, with 159 new exercises on symmetric functions, all with solutions or references to solutions.

Format: Paperback / softback
Length: 788 pages
Publication date: 17 August 2023
Publisher: Cambridge University Press

Richard Stanley's two-volume fundamental introduction to enumerative combinatorics has emerged as the de facto reference guide for students and professionals in the field. This extensively revised second edition of volume two delves into various aspects of generating functions, encompassing composition, such as the exponential formula and the Lagrange inversion formula, labeled and unlabeled trees, algebraic, D-finite, and noncommutative generating functions, as well as symmetric functions. The chapter dedicated to symmetric functions stands as the sole comprehensive treatment of this subject tailored for an introductory graduate course with a focus on combinatorics, particularly emphasizing the Robinson–Schensted–Knuth algorithm. An appendix authored by Sergey Fomin explores deeper aspects of symmetric functions, including jeu de taquin and the Littlewood–Richardson rule. The book's extensive exercise section plays a pivotal role in solidifying the material, with this second edition featuring over 400 exercises, including 159 new exercises specifically on symmetric functions, all accompanied by solutions or references to solutions.

Weight: 1120g
Dimension: 153 x 230 x 45 (mm)
ISBN-13: 9781009262484
Edition number: 2 Revised edition