A First Course in Combinatorial Mathematics
Summary
The feel-good place to buy books
A First Course in Combinatorial Mathematics by Ian Anderson
The spirit and aim of this book is to present a compact 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. A studly of block designs is followed by a brief mention of applications to coding theory. In this new edition, Steiner triple systems are constructed and S(5,8,24) is obtained via the Golay code of length 24. The final chapter combines together the three combinatorial structures of the Leech lattice, the Golay codes, and Steiner systems. Also in this edition, an application of the marriage theorem to score sequences of tournaments has been included.
'..excellent introductory text...' Times Higher Education Supplement
'..happy introduction for many people...' Computer Journal
'..happy introduction for many people...' Computer Journal
| SKU | Unavailable |
| ISBN 13 | 9780198596738 |
| ISBN 10 | 0198596731 |
| Title | A First Course in Combinatorial Mathematics |
| Author | Ian Anderson |
| Series | Oxford Applied Mathematics And Computing Science Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Oxford University Press |
| Year published | 1989-05-04 |
| Number of pages | 144 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |