A First Course in Combinatorial Mathematics

Ian Anderson

ISBN 10: 0198596731 / ISBN 13: 9780198596738

Published by Clarendon Press, Oxford, 1990

About this Item

Former academic library book, with library bookplate to front pastedown; ink stamps to endpapers, including withdrawn stamp. All pages unmarked and uncreased. In good shape overall. Publisher's note: This introduction to the basic combinatorial tools, such as recurrence relations, generating functions, incidence matrices and the inclusion-exclusion principle, has been designed to give readers a flavour of the distinctive characteristics of this branch of mathematics. Size: 21.6 x 14 x 0.9 cm. x, 134 pp. Shipped Weight: Under 500 grams. Category: Mathematics; Combinatorial analysis; ISBN: 0198596731. ISBN/EAN: 9780198596738. Add. Inventory No: 250322CT5021.

Seller Inventory # 250322CT5021

Bibliographic Details

• Title: A First Course in Combinatorial Mathematics
• Publisher: Clarendon Press, Oxford
• Publication Date: 1990
• Language: English
• ISBN 10: 0198596731
• ISBN 13: 9780198596738
• Binding: Softcover
• Edition: 2nd Edition
• Condition: Good
• Seller catalogs:
  • Mathematics

About this title

Synopsis

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.

From the Back Cover

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.