CART

(0) items

Enumerative Combinatorics: Volume 1

by
Edition:
2nd
ISBN13:

9781107602625

ISBN10:
1107602629
Format:
Paperback
Pub. Date:
1/31/2012
Publisher(s):
Cambridge Univ Pr

Questions About This Book?

Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 2nd edition with a publication date of 1/31/2012.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

Summary

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.

Author Biography

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 Combinatories, he is the author of Combinatories and Commutative Algebra (1983) and more than 100 research articles in National Academy of Sciences (elected in 1995), the 2001 Leroy P. Steele Prize for mathematical exposition, and the 2003 Schock Prize.

Table of Contents

Prefacep. xi
Acknowledgmentsp. xiii
What Is Enumerative Combinatorics?p. 1
How to Countp. 1
Sets and Multisetsp. 15
Cycles and Inversionsp. 22
Descentsp. 31
Geometric Representations of Permutationsp. 41
Alternating Permutations, Euler Numbers, and the cd-lndex of $$$np. 46
Permutations of Multisetsp. 54
Partition Identitiesp. 61
The Twelvefold Wayp. 71
Two q-Analogues of Permutationsp. 80
Notesp. 97
Bibliographyp. 100
Exercises for Chapter 1p. 103
Solutions to Exercisesp. 141
Sieve Methodsp. 195
Inclusion-Exclusionp. 195
Examples and Special Casesp. 198
Permutations with Restricted Positionp. 202
Ferrers Boardsp. 207
V-Partitions and Unimodal Sequencesp. 209
Involutionsp. 212
Determinantsp. 215
Notesp. 218
Bibliographyp. 219
Exercises for Chapter 2p. 220
Solutions to Exercisesp. 231
Partially Ordered Setsp. 241
Basic Conceptsp. 241
New Posets from Oldp. 246
Latticesp. 248
Distributive Latticesp. 252
Chains in Distributive Latticesp. 256
Incidence Algebrasp. 261
The Möbius Inversion Formulap. 264
Techniques for Computing Möbius Functionsp. 266
Lattices and Their Möbius Functionsp. 274
The Mobius Function of a Semimodular Latticep. 277
Hyperplane Arrangementsp. 280
Zeta Polynomialsp. 291
Rank Selectionp. 293
R-Labelingsp. 295
(P,¿)-Partitionsp. 298
Eulerian Posetsp. 310
The cd-Index of an Eulerian Posetp. 315
Binomial Posets and Generating Functionsp. 320
An Application to Permutation Enumerationp. 327
Promotion and Evacuationp. 330
Differential Posetsp. 334
Notesp. 345
Bibliographyp. 349
Exercises for Chapter 3p. 353
Solutions to Exercisesp. 408
Rational Generating Functionsp. 464
Rational Power Series in One Variablep. 464
Further Ramificationsp. 467
Polynomialsp. 471
Quasipolynomialsp. 474
Linear Homogeneous Diophantine Equationsp. 475
Applicationsp. 488
The Transfer-Matrix Methodp. 500
Notesp. 523
Bibliographyp. 526
Exercises for Chapter 4p. 528
Solutions to Exercisesp. 548
Appendix: Graph Theory Terminologyp. 571
First Edition Numberingp. 575
List of Notation (Partial)p. 581
Indexp. 585
Table of Contents provided by Ingram. All Rights Reserved.


Please wait while the item is added to your cart...