A second printing was published by Cambridge University Press in April, The second printing differs from the first only in a the correction of short errors, b a list of errata for longer errors, and c some Supplementary Problems without solutions. A paperback edition of Volume 1, second printing, is now available. It differs from the hardcover edition only in a slightly updated list of Errata and Addenda.
|Published (Last):||2 August 2011|
|PDF File Size:||14.4 Mb|
|ePub File Size:||5.8 Mb|
|Price:||Free* [*Free Regsitration Required]|
About this title 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 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.
Book Description: This is the second volume of a two-volume work on the subject of enumerative combinatorics, an area of mathematics with connections to many other topics within and outside of mathematics, such as computer science, spectroscopy, algebraic geometry, algebraic topology, and representation theory.
Many topics covered in particular, the theory of symmetric functions are not available in any other textbook at this level, and the usefulness of the book is enhanced by over exercises with solutions. Although primarily intended as a textbook for graduate students and a resource for professional mathematicians, some parts of the book will be accessible to mathematics undergraduates and even interested amateurs. About the Author: Richard P.
He is universally recognized as a leading expert in the field of combinatorics and its applications to a variety of other mathematical disciplines. In addition to the seminal two-volume book Enumerative Combinatorics, he is the author of Combinatorics and Commutative Algebra as well as more than research articles in mathematics. Steele Prize for mathematical exposition and the Schock Prize.
Enumerative combinatorics. Vol. 2
Shaktibar There was a problem filtering reviews right now. Combinatorics seems a hodge-podge subject to many mathematicians, but Stanley manages to see it as a unified subject with a number of general theories and common techniques. The chapter on symmetric functions provides the only available sttanley of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Get to Know Us. Both volumes highly recommended for all libraries.
Enumerative combinatorics. — Vol. 2
ISBN 13: 9780521560696