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)
Constructive combinatorics. (English) Zbl 0595.05002
Undergraduate Texts in Mathematics. New York etc.: Springer-Verlag. X, 183 p. DM 48.00 (1986).

This volume is the amplification of course notes in the area of ’constructive combinatorics’. This area includes the enumeration and listing of various kinds of finite structures as well as use of constructive arguments to prove theorems.

The text is suitable for an undergraduate level, involving few if any prerequisites. Further, it covers an attractive selection of topics and is full of stimulating questions and clever arguments that will be inspirational to many mathematics students.

A strong point is the set of exercises which are numerous and at various levels of challenge. There is also an appendix containing programs which implement some of the algorithms discussed in the text.

The subject matter is divided into four chapters; the first concerns enumeration of basic structures, such as permutations and partitions of sets and of integers, with emphasis on actual listing of such entities. The second concerns partially ordered sets including application to the Littlewood-Offord problem. A section on bijections, including discussion of the Prüfer Correspondence and Schensted’s Correspondence and tableaux is the largest chapter. Finally, a chapter entitled ’Involutions’ contains discussions of such topics as Vandermonde’s determinant, the Cayley-Hamilton theorem and the matrix-tree theorem, and of lattice paths.

This subject matter has the virtue that one can get into non-trivial mathematical results without bogging down in definitions or requiring lots of prior knowledge. It is an ideal ground therefore, for a student to be exposed to in order to realize that she or he loves mathematics and can relate to it. I therefore think that courses in this area should be encouraged. This is an excellent text for such a course.

Reviewer: D.J.Kleitman
MSC:
05-01Textbooks (combinatorics)
05AxxClassical combinatorial problems
05A15Exact enumeration problems, generating functions
06A05Total order
05-04Machine computation, programs (combinatorics)