A First Course in Combinatorial Mathematics by Ian Anderson

A First Course in Combinatorial Mathematics

byIan Anderson

Paperback | April 30, 1999

not yet rated|write a review

Pricing and Purchase Info

$102.95

Earn 515 plum® points

In stock online

Ships free on orders over $25

Not available in stores

about

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 thisattractive 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 Leechlattice, the Golay codes, and Steiner systems. Also in this edition, an application of the marriage theorem to score sequences of tournaments has been included.

About The Author

Ian Anderson is at University of Glasgow.
Sports Betting: Law and Policy
Sports Betting: Law and Policy

by Paul M. Anderson

$193.89$242.25

Available for download

Not available in stores

The Evil Within #3
The Evil Within #3

by Ian Edginton

$3.98

Available for download

Not available in stores

The Evil Within: Comic zum Game
The Evil Within: Comic zum Game

by Ian Edginton

$16.99

Available for download

Not available in stores

Shop this author

Details & Specs

Title:A First Course in Combinatorial MathematicsFormat:PaperbackDimensions:144 pages, 8.5 × 5.43 × 0.31 inPublished:April 30, 1999Publisher:Oxford University Press

The following ISBNs are associated with this title:

ISBN - 10:0198596731

ISBN - 13:9780198596738

Look for similar items by category:

Customer Reviews of A First Course in Combinatorial Mathematics

Reviews

Extra Content

From Our Editors

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.

Editorial Reviews

'..happy introduction for many people...' Computer Journal