A First Course in Combinatorial Mathematics (Paperback)

Ian Anderson

ISBN 10: 0198596731 / ISBN 13: 9780198596738

Published by Oxford University Press, Oxford, 1989

About this Item

Paperback. 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 theLeech 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. The spirit and aim of this book is to present a compact introduction to the basic combinatorial tools that will give the reader a flavour of the distinctive characteristics of this attractive and increasingly important branch of mathematics. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Seller Inventory # 9780198596738

Bibliographic Details

• Title: A First Course in Combinatorial Mathematics (Paperback)
• Publisher: Oxford University Press, Oxford
• Publication Date: 1989
• Language: English
• ISBN 10: 0198596731
• ISBN 13: 9780198596738
• Binding: Paperback
• Edition: 2nd Edition
• Condition: new

About this title

Synopsis

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.

About the Author

Ian Anderson is at University of Glasgow.