Enumerative Combinatorics
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.
- Includes hundreds of exercises, most with solutions that augment the text and present new results
- Offers many connections with other areas of mathematics, such as finite fields, algebraic topology and polytopes
- Discusses many topics not found in other texts, such as the cd-index, combinatorial properties of GL(n,q), promotion and evacuation, and P-partitions
Reviews & endorsements
'… sure to become a standard as an introductory graduate text in combinatorics.' Bulletin of the American Mathematical Society
'… will engage from start to finish the attention of any mathematician who will open it at page one.' Gian-Carlo Rota
Product details
No date availablePaperback
9781107602625
642 pages
226 × 153 × 34 mm
0.85kg
165 b/w illus. 536 exercises
Table of Contents
- 1. What is enumerative combinatorics?
- 2. Sieve methods
- 3. Partially ordered sets
- 4. Rational generating functions.