zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Enumerative combinatorics. Volume 2. (English) Zbl 0928.05001
Cambridge Studies in Advanced Mathematics. 62. Cambridge: Cambridge University Press. xii, 581 p. £45.00; $ 69.95 (1999).

[Compare Zbl 0608.05001 for the first edition of Volume 1 and Zbl 0889.05001 for the second one.]

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.

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.

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.


MSC:
05-02Research monographs (combinatorics)
05A15Exact enumeration problems, generating functions
05A16Asymptotic enumeration
06A07Combinatorics of partially ordered sets
05E05Symmetric functions and generalizations