S (01) Article electronically published on October 12, Enumerative combinatorics, Volume 2, by Richard P. Stanley, Cambridge Univer . Both volumes already had pages on MAA Reviews, because both appeared in the a common assumption, because one now finds a note on Stanley’s web site indicating that “there will be no second edition of Volume 2. Volume 1 of Enumerative Combinatorics was published by Wadsworth Volumes 1 and 2 can be ordered online from Cambridge University Press ( volume 1.
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.
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”! 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. Add to Cart Add to Cart. Contents Trees and the Composition of Generating Functions.
Set up a giveaway. 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 combinatorica exposition of that topic, and I think somewhat easier to understand than the rest of the book.
Amazon Advertising Find, attract, and engage customers. Learn more about Amazon Giveaway. The chapter on symmetric functions provides Some of the material in this book is easier than others; some of it depends on earlier chapters, but some stands on its own. English Choose a language for shopping. There are over exercises, all with solutions or references to solutions, many of which concern previously unpublished results.
All in all, very recommendable I am referring to volume 1 only, I did not read volume 2 I have now March also read volume II Once again, the formal prerequisites are not very high, but the proofs are definitely harder to understand combnatorics in volume I! ComiXology Thousands of Digital Comics.
An Introduction to Enumeration and Graph Theory. This second volume of a two-volume basic introduction to enumerative combinatorics combintaorics the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. Editorial Reviews Review ” Also covered are connections between symmetric functions and representation theory.
A few additional lines of explanation would have made the proofs easier to understand – at least for an “ar chair mathematician”! How many copies would you like to buy? Withoutabox Submit to Film Festivals. Amazon Drive Cloud storage from Amazon.
People who find this book difficult to follow may want still benefit from some of the easier exercises. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. Cambridge University Press- Mathematics – pages.
This book is truly the only text I have ever read that has this perspective on the subject. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. No one will dare try, let alone be able, to match the thoroughness of coverage, the care for detail, the combintorics of proof, the elegance of presentation.
The most precious thing about this book is that the author manages to provide several comprehensive frameworks for solving large classes of enumeration problems. Beginners will find it an accessible introduction to the subject, and experts will still find much to learn from it. 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.
Account Options Sign in. Not Enabled Enhanced Typesetting: As in Volume 1, the exercises play a vital role in developing the material. Not Enabled Word Wise: 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.
Showing of 12 reviews. This book is meant to be “read” with pencil and paper in hand.
Enumerative Combinatorics: Volume 2
Would you like to tell us about a lower price? Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference. Volume 2 by Richard P.
The author often chooses a more general framework in which to present things, and this can make the material quite difficult to follow. As in Volume 1, the exercises play a vital role in developing the material. Students wanting an easier-to-follow text might want to check out Cameron’s “Combinatorics”, or Wilf’s “Generatingfunctionology”. Stanley’s book is a valuable contribution to enumerative combinatorics. Product details File Size: 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.
See all 12 reviews.
Kindle Edition Verified Purchase. Not meant for the novice, and a very hard read for even the intermediate.