A First Course in Combinatorial Mathematics
Series: Oxford Applied Mathematics and Computing Science Series;
- Publisher's listprice GBP 76.00
-
34 314 Ft (32 680 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 3 431 Ft off)
- Discounted price 30 883 Ft (29 412 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
34 314 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2
- Publisher OUP Oxford
- Date of Publication 4 May 1989
- ISBN 9780198596738
- Binding Paperback
- No. of pages144 pages
- Size 216x138x8 mm
- Weight 186 g
- Language English
- Illustrations illustrations throughout 0
Categories
Short 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.
In this new edition, Steiner triple systems are constructed and S(5,8,24) is obtained via the Golay code of length 24; also included is an application of the marriage theorem to score sequences of tournaments.
Long 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.
' ...excellent introductory text...' Times Higher Education Supplement
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
More
