
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding theory.
This text investigates the foundational principles and applications of combinatorial mathematics, providing a structured introduction to the field. Ian Anderson, a recognized authority in the discipline, utilizes a pedagogical approach to bridge the gap between basic theory and complex applications. The book synthesizes core mathematical tools with practical examples, ensuring that students and practitioners can apply these concepts to problems in coding theory and design theory.
What You Will Find
Experts and educators frequently cite this volume as a foundational text for students entering the field of combinatorics. Readers often note the clarity of the prose and the effectiveness of the sample problems in reinforcing complex mathematical concepts.
Page Count:
144
Publication Date:
1989-11-16
Publisher:
Oxford University Press
ISBN-10:
019859674X
ISBN-13:
9780198596745
No comments yet. Be the first to share your thoughts!