A First Course in Combinatorial Mathematics
by Ian Anderson 2020-11-24 17:21:17
image1
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 flavou... Read more
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. Less
  • File size
  • Print pages
  • Publisher
  • Publication date
  • Language
  • ISBN
  • 8.5 X 5.43 X 0.31 in
  • 144
  • Oxford University Press
  • April 30, 1999
  • English
  • 9780198596738
Born in Oregon and based in California, Ian Anderson has been road-tripping up and down the West Coast since before he could see over the steering wheel. Over the past two decades, he's lived in Portl...
Compare Prices
image
Paperback
Available Discount
No Discount available
Related Books