A First Course in Combinatorial Mathematics (Oxford Applied Mathematics and Computing Science Series)

A First Course in Combinatorial Mathematics (Oxford Applied Mathematics and Computing Science Series)

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. ' ...excellent introductory text...' Times Higher Education Supplement'..happy introduction for many people...' Computer Journal The Spirit and aim of this textbook is to present a concise introduction to the basic combinatorial tools--such as recurrence relations, generating functions, incidence matrices, and the inclusion-exclusion principle--that will give the reader a flavour of the distinctive characteristics of this attractive and increasingly important branch of mathematics. Ian Anderson is at University of Glasgow.