Description
Enumerative Combinatorics. Volume 2 develops advanced methods for solving and studying combinatorial enumeration problems. The book covers compositions of generating functions, including the exponential formula and Lagrange inversion, as well as labelled and unlabelled trees, algebraic, D-finite, and noncommutative generating functions, and symmetric functions. It gives particular attention to the combinatorial aspects of the Robinson–Schensted–Knuth algorithm and includes an appendix on deeper topics in symmetric functions. The second edition substantially expands the exercises, with more than 400 problems, including many new exercises on symmetric functions. The text is intended for advanced undergraduate and graduate study and for researchers working in combinatorics and related areas.
