zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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. Vol. 1. (English) Zbl 0889.05001
Cambridge Studies in Advanced Mathematics. 49. Cambridge: Cambridge University Press. xi, 325 p. £ 40.00; $ 59.95 (1997).
[See Zbl 0608.05001 for the first edition published by Wadsworth.] As the author explains in his introduction: “This book has three intended audiences and serves three different purposes. First, it may be used as a graduate-level introduction to a fascinating area of mathematics $\dots$. The second intended audience consists of professional combinatorialists, for whom this book could serve as a general reference $\dots$. Finally, this book may be used by mathematicians outside combinatorics whose work requires them to solve a combinatorial problem.” The book serves all of these audiences well. The first chapter is a basic introduction to combinatorics and includes the fundamental counting formulas organized as counting functions under various conditions. The second chapter is devoted to a discussion of sieve methods. The remainder of the book consists of two long chapters: Partially ordered sets and Rational generating functions. The book contains many careful examples and includes a large variety of exercises. The exercises are rated as to difficulty and a complete set of solutions is included. In addition each chapter contains a collection of historical notes and an extensive set of references.

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