A First Course in Combinatorial Mathematics / Edition 2

by Ian Anderson

Overview

Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding theory.

Product Details

ISBN-13:	9780198596738
Publisher:	Oxford University Press
Publication date:	10/12/1989
Series:	Oxford Applied Mathematics and Computing Science Series
Edition description:	REV
Pages:	144
Product dimensions:	8.50(w) x 5.44(h) x 0.38(d)

About the Author

University of Glasgow

Table of Contents

1. Introduction to Basic Ideas2. Selections and Binomial Coefficients3. Pairings Problems4. Recurrence5. The Inclusion-Exclusion Principle6. Block Designs and Error-Correcting Codes7. Steiner Systems, Sphere Packings, and the Golay Code

Editorial Reviews

A concise introductory textbook covering the basic combinatorical tools such as recurrence relations, generating functions, incidence matrices, and the inclusion-exclusion principle. Cloth edition (unseen), $75. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews