Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the author
OK
Enumerative Combinatorics, Volume 1 First Edition
Review
Bulletin of the AMS
"Stanley's book is very readable and a mine of information."
Journal of the LMS
"...will engage from start to finish the attention of any mathematician who will open it at page one."
Gian-Carlo Rota
"...an excellent and valuable book."
Mathematical Reviews
Book Description
- ISBN-100521663512
- ISBN-13978-0521663519
- EditionFirst Edition
- PublisherCambridge University Press
- Publication dateFebruary 28, 2000
- LanguageEnglish
- Dimensions6.25 x 0.75 x 12 inches
- Print length340 pages
Product details
- Publisher : Cambridge University Press; First Edition (February 28, 2000)
- Language : English
- Paperback : 340 pages
- ISBN-10 : 0521663512
- ISBN-13 : 978-0521663519
- Item Weight : 1.04 pounds
- Dimensions : 6.25 x 0.75 x 12 inches
- Best Sellers Rank: #3,726,458 in Books (See Top 100 in Books)
- #564 in Combinatorics (Books)
- #631 in Functional Analysis Mathematics
- #713 in Discrete Mathematics (Books)
- Customer Reviews:
Important information
To report an issue with this product or seller, click here.
About the author

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Some of the material in this book is easier than others; some of it depends on earlier chapters, but some stands on its own. People interested in partially ordered sets and lattices may want to jump ahead to that chapter--much of this chapter stands on its own, and it is an excellent exposition of that topic, and I think somewhat easier to understand than the rest of the book.
The most precious thing about this book is that the author manages to provide several comprehensive frameworks for solving large classes of enumeration problems. 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. This book is truly the only text I have ever read that has this perspective on the subject.
I would recommend this book only to someone who has a strong background in mathematics and wants a challenging text that can take them to a deeper level of understanding. Students of combinatorics may want to take this book out of the library and read the introductory pages; there are some particularly useful comments right at the beginning. As a final note, the exercises in this book are also helpful and of diverse difficulty levels--and Stanley classifies the exercises by their difficulty level. People who find this book difficult to follow may want still benefit from some of the easier exercises. Students wanting an easier-to-follow text might want to check out Cameron's "Combinatorics", or Wilf's "Generatingfunctionology". As a final note I would like to remark that this book is very reasonably priced, especially when you consider the wealth of material it contains.
While I do not believe, that this book is suitable as a first introduction to combinatorics, it is a great book for anyone, who is interested in the subject and has had some prior exposure.
The formal mathematical prerequisites are quite minimal. The proofs are such, that after some thinking one can understand them - and they are always rigorous.
If one some occasions, the author would have given a short hint, instead of simply saying "it is easily seen" this would have made the book even more readable (but even then, after enough thinking one does see, albeit maybe not easily...)
All in all, very recommendable
(I am referring to volume 1 only, I did not read volume 2)
I have now ( March 2011) also read volume II
Once again, the formal prerequisites are not very high, but the proofs are definitely harder to understand than in volume I! While chapters 5&6 are still not too difficult, chapter 7 ( about symmetric functions) certainly is hard. A few additional lines of explanation would have made the proofs easier to understand - at least for an "ar chair mathematician"!
The book contains mainy excercises with solutions(!!!), which I did not attempt, so I cannot comment on them.
The book is virtually free of any typos, I counted maybe 10 harmless ones.
I would still recommend volume II to anybody seriously interested in combinatorics, but it is definitely harder than volume I
Overall, my rating remains at "full score"!