A first course in combinatorial mathematics
Author(s)
Bibliographic Information
A first course in combinatorial mathematics
(Oxford applied mathematics and computing science series)
Clarendon Press , Oxford University Press, 1989
2nd ed.
- : pbk
Available at 29 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Bibliography: p. 131-132
Includes index
Description and Table of Contents
- Volume
-
: pbk ISBN 9780198596738
Description
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.
Table of Contents
- Introduction to basic ideas
- Selections and binomial coefficients
- Pairing problems
- Recurrence
- The inclusion-exclusion principle
- Block designs and error-correcting codes
- Steiner systems, sphere packings, and the Golay code
- Solutions to exercises
- Bibliography
- Index
- Volume
-
ISBN 9780198596745
Description
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. The text contains a study of block designs, which is followed by a brief mention of their application to coding theory. In this new edition, Steiner triple systems are constructed and the three combinatorial structures of the Leech lattice, the Golay codes and Steiner systems are examined. The edition also includes an application of the marriage theorem to score sequences of tournaments.
Table of Contents
- Selections and binomial coefficients
- pairings problems
- recurrence
- the inclusion-exclusion principle
- block designs and error-correcting codes
- Steiner systems, sphere packings and the Golay code.
by "Nielsen BookData"