Enumerative Combinatorics: Volume 1 (2^nd Ed.) Cambridge Studies in Advanced Mathematics Series

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 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets.

1. What is enumerative combinatorics?; 2. Sieve methods; 3. Partially ordered sets; 4. Rational generating functions.

Richard P. Stanley is a Professor of Applied Mathematics at the Massachusetts Institute of Technology. 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 (1983) as well as more than 100 research articles in mathematics. Among Stanley's many distinctions are membership in the National Academy of Sciences (elected in 1995), the 2001 Leroy P. Steele Prize for mathematical exposition and the 2003 Schock Prize.