Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Simple Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Simple Search

Query:
Enter a query and click »Search«...
Format:
Display: entries per page entries
Zbl 0928.05001
Stanley, Richard P.
Enumerative combinatorics. Volume 2.
(English)
[B] Cambridge Studies in Advanced Mathematics. 62. Cambridge: Cambridge University Press. xii, 581 p. \sterling 45.00; \$ 69.95 (1999). ISBN 0-521-56069-1/hbk

[Compare Zbl 0608.05001 for the first edition of Volume 1 and Zbl 0889.05001 for the second one.]\par This long awaited Volume 2 of Enumerative Combinatorics by Richard Stanley was well worth the wait! At 581 pages it is almost twice the length of Volume 1. Much of the increase in size has to do with the inclusion of even more exercises and solutions than in Volume 1. These carefully selected and organized problems along with their solutions is one of the assets of this book as a graduate text.\par Volume 2 has just three chapters. Chapters 5 (Trees and the Composition of Generating Functions) and 6 (Algebraic, D-Finite, and Noncommutative Generating Functions) continue the development of generating functions initiated in the last chapter of Volume 1. Chapter 7 (Symmetric Functions) includes many traditional topics (e.g. Pólya Enumeration) but in this newly designed framework of symmetric functions. Seeing so many seemingly disjoint topics arranged and unified by one central theme makes reading Chapter 7 a joy.\par This magnificent two-volume work is best described by a quote from Gian-Carlo Rota's Forward to Volume 2: I find it impossible to predict when Richard Stanley's two-volume exposition of combinatorics may be superseded. No one will dare try, let alone be able, to match the thoroughness of coverage, the care for detail, the definitiveness of proof, the elegance of presentation.
[J.E.Graver (Syracuse)]
MSC 2000:
*05-02 Research monographs (combinatorics)
05A15 Combinatorial enumeration problems
05A16 Asymptotic enumeration
06A07 Combinatorics of partially ordered sets
05E05 Symmetric functions

Keywords: enumerative combinatorics; generating functions; Pólya enumeration; exercises; symmetric functions

Citations: Zbl 0608.05001; Zbl 0889.05001

Cited in: Zbl 1257.05005 Zbl 1142.05075 Zbl 1134.16017 Zbl 1130.05004 Zbl 1104.05006 Zbl 1056.05008 Zbl 0995.05145 Zbl 0971.52012

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster