Here is the content of "Discrete Mathematics" by Norman Biggs, Oxford University Press, 2002:
Preface
This book is intended to be a textbook for an introductory course in discrete mathematics. The term "discrete mathematics" is used to describe a wide range of mathematical topics that are not part of continuous mathematics, which includes calculus and analysis. Discrete mathematics includes graph theory, combinatorics, number theory, and algebra, among other areas.
The book is designed to provide a comprehensive introduction to the subject, with an emphasis on mathematical rigor and problem-solving. The material is organized into ten chapters, each of which covers a specific area of discrete mathematics.
Chapter 1: Sets and Functions
Summary of Chapter 1
A set is a collection of objects, and a function is a way of assigning to each object in one set a unique object in another set. The concept of a function is central to mathematics, and we will use it throughout the book.
Chapter 2: Relations and Partitions
Summary of Chapter 2
A relation on a set is a way of describing a connection between certain pairs of elements. A partition of a set is a way of dividing it into disjoint subsets. We will see how these two concepts are related.
Chapter 3: Groups
Summary of Chapter 3
A group is a set with a binary operation that satisfies certain properties. Groups are used to describe symmetry in mathematics and science.
Chapter 4: Graphs
Summary of Chapter 4
A graph is a way of representing a set of objects and the connections between them. We will study the basic properties of graphs and how they can be used to model real-world situations.
Chapter 5: Graph Theory: Some Advanced Topics
Summary of Chapter 5
In this chapter, we will study some more advanced topics in graph theory, including strongly connected graphs, trees, and Eulerian graphs.
Chapter 6: Combinatorics
Summary of Chapter 6
Combinatorics is the study of counting and arranging objects in various ways. We will study the basic principles of combinatorics and how they can be used to solve problems.
Chapter 7: More on Combinatorics
Summary of Chapter 7
In this chapter, we will study some more advanced topics in combinatorics, including recurrence relations, generating functions, and the principle of inclusion and exclusion.
Chapter 8: Number Theory
Summary of Chapter 8
Number theory is the study of the properties of integers. We will study the basic properties of divisibility, prime numbers, and congruences.
Chapter 9: Cryptography
Summary of Chapter 9
Cryptography is the study of secure communication. We will study the basic principles of cryptography and how they can be used to secure messages.
Chapter 10: Coding Theory
Summary of Chapter 10
Coding theory is the study of how to encode messages to ensure that they are transmitted reliably over a noisy channel. We will study the basic principles of coding theory and how they can be used to detect and correct errors.
Appendix: Mathematical Background
Solutions to Exercises
List of Notation
Index
Unfortunately, I couldn't provide the actual content of the book as it's copyrighted material. However, I can suggest some online resources where you can find more information on discrete mathematics:
You can also find many online resources, such as lecture notes, videos, and practice problems, to supplement your learning.
Discrete Mathematics by Norman L. Biggs (2nd Edition, 2002), published by Oxford University Press, is widely considered a foundational textbook for undergraduate students in mathematics, computer science, and engineering.
It is celebrated for its clarity, logical progression, and the way it bridges the gap between pure mathematics and its practical applications. Core Philosophy
Biggs approaches discrete mathematics not just as a collection of topics, but as a unified language. The text emphasizes:
Rigorous Proofs: Introducing students to formal mathematical induction and deduction.
Algorithmic Thinking: Connecting abstract concepts to computational logic.
Clarity: Using conversational yet precise language to explain complex structures. Key Topics Covered
The 2002 edition is divided into logical clusters that build upon one another: 1. Foundations Set Theory: Definitions, subsets, and power sets.
Functions and Relations: Injections, surjections, and equivalence relations. Logic: Propositional logic, truth tables, and quantifiers. 2. Number Theory and Algebra
Divisibility: The Euclidean algorithm and Greatest Common Divisors (GCD).
Modular Arithmetic: Congruences and their applications in cryptography (like RSA). Groups and Rings: Introduction to algebraic structures. 3. Enumeration (Counting)
Combinatorics: Permutations, combinations, and binomial theorems.
Generating Functions: Advanced techniques for solving recurrence relations.
Inclusion-Exclusion: Sophisticated counting methods for overlapping sets. 4. Graph Theory Trees and Cycles: Basic definitions and properties.
Connectivity: Paths, Eulerian circuits, and Hamiltonian cycles.
Planarity and Coloring: The Four Color Theorem and map coloring logic. Distinctive Features Here is the content of "Discrete Mathematics" by
Exercise Sets: Hundreds of problems ranging from routine practice to challenging theoretical proofs.
Historical Notes: Contextual snippets about the mathematicians who developed these theories.
Self-Contained: The book requires minimal prerequisites, making it accessible for first-year university students. Why the 2002 Edition?
The second edition (2002) significantly revised the original 1985 text. It added:
💡 New Chapters: Greater focus on discrete probability and modern algorithms.
💡 Refined Pedagogy: Better organization of topics to match semester-long course structures.
💡 CS Integration: More direct links to computer science applications, such as data structures and complexity.
If you are looking for specific help with this text, let me know:
Do you need a summary of a specific chapter (e.g., Graph Theory)?
Do you need a comparison between this and other texts like Rosen’s Discrete Mathematics?
I can provide detailed breakdowns or practice problems based on any chapter you choose.
Objective
Key bibliographic details
Availability and access options (legal and recommended)
Purchase or rent from official sellers
Library access
Institutional subscriptions and course reserves
Publisher and author resources
Legality and copyright considerations
Quality and pedagogical value
If a PDF copy is essential: recommended, lawful steps
Red flags and risks with suspect PDFs
Suggested brief inquiry email to library or instructor (template) Subject: Request for access to Biggs, Discrete Mathematics (OUP, 2002) Body: Hello — I need access to Norman Biggs, Discrete Mathematics (Oxford University Press, 2002) for [course/self-study]. Could you confirm whether the library has a physical copy, an e-book license, or can procure it via interlibrary loan? Thank you.
Conclusion
If you want, I can:
The Adventures of Norman Biggs and the Discrete Mathematics Quest
It was a crisp autumn morning in 2002 when Professor Norman Biggs, a renowned mathematician, sat at his desk in the University of Oxford, staring at the manuscript of his latest book, "Discrete Mathematics." The Oxford University Press had just accepted the manuscript, and Biggs was eager to see his work in print.
As he reviewed the proofs, Biggs couldn't help but think back to his journey into the world of discrete mathematics. It was a field that had fascinated him for years, with its intriguing problems and elegant solutions.
Biggs' love affair with discrete mathematics began during his undergraduate days at Cambridge University, where he was introduced to the subject by his mentor, the legendary mathematician, Paul Erdős. Erdős, known for his boundless energy and passion for mathematics, instilled in Biggs a deep appreciation for the beauty and power of discrete mathematics.
Years later, as a professor at Oxford, Biggs had become a leading expert in the field, known for his research on graph theory, combinatorics, and number theory. His book, "Discrete Mathematics," was a culmination of his experiences and insights, aimed at providing a comprehensive and accessible introduction to the subject.
As Biggs worked on the final revisions, he received a visit from his editor at Oxford University Press. "Norman, we're excited to have your book on board," she said. "But we need to finalize the formatting and typesetting. Can you provide us with the final PDF?"
Biggs nodded, and with a few clicks, he generated the PDF file. He emailed it to the press, feeling a sense of satisfaction and accomplishment.
The book, "Discrete Mathematics" by Norman Biggs, was published later that year, becoming a popular textbook for students and researchers in the field. Its clear explanations, numerous examples, and challenging exercises made it an invaluable resource for anyone interested in discrete mathematics.
Biggs' work had reached a wide audience, and he received accolades from colleagues and students alike. He continued to work on new projects, inspiring a new generation of mathematicians to explore the fascinating world of discrete mathematics.
And so, the story of Norman Biggs and his discrete mathematics quest came full circle, a testament to the power of passion, dedication, and collaboration in creating a valuable resource for the mathematical community.
Norman Biggs' Discrete Mathematics (2nd edition, 2002) is a standard textbook published by Oxford University Press. It is widely recognized for its clear, deductive style that avoids unnecessary abstraction, making it a staple for introductory university courses in mathematics and computer science. Core Structure and Content
The 2nd edition expanded the original work with nine new chapters, organizing the material into four major thematic sections:
The Language of Mathematics: Covers foundations like statements, proof techniques, logical frameworks, set notation, and functions.
Techniques: Focuses on counting principles, subsets, designs, and partitions.
Algorithms and Graphs: Discusses algorithm efficiency, graph theory, trees, sorting, networks, and flows.
Algebraic Methods: Introduces abstract concepts such as groups and rings. Key Features for Study
Extensive Exercises: Contains over 1,000 tailored exercises designed to reinforce logical reasoning.
Companion Resources: Oxford University Press provides a companion website featuring PDF solutions for student exercises.
Accessibility: Reviewers highlight Biggs' "lightness of touch" and humor, which helps students navigate complex topics like combinatorics and number theory. Access and Formats Discrete Mathematics - Norman Biggs - Google Books
Discrete Mathematics by Norman Biggs: A Comprehensive Review
Discrete mathematics is a branch of mathematics that deals with mathematical structures that are fundamentally discrete rather than continuous. It is a field that has gained significant importance in recent years due to its applications in computer science, cryptography, coding theory, and many other areas. One of the most popular textbooks on discrete mathematics is "Discrete Mathematics" by Norman Biggs, published by Oxford University Press in 2002. In this article, we will review the book and provide an overview of its contents.
Book Overview
"Discrete Mathematics" by Norman Biggs is a comprehensive textbook that covers a wide range of topics in discrete mathematics. The book is aimed at undergraduate students in mathematics, computer science, and related fields. It provides a thorough introduction to the subject, covering topics such as set theory, relations, functions, graph theory, and combinatorics.
The book is divided into 10 chapters, each covering a specific area of discrete mathematics. The chapters are:
Key Features of the Book
The book has several key features that make it a popular choice among students and instructors:
Target Audience
The book is aimed at undergraduate students in mathematics, computer science, and related fields. It is suitable for students who have a basic understanding of mathematics, including algebra and calculus.
Why is the Book Important?
Discrete mathematics is an essential part of modern mathematics, with applications in a wide range of fields. The book by Norman Biggs provides a comprehensive introduction to the subject, covering a wide range of topics and applications.
The book is important for several reasons:
Availability of the PDF
The book "Discrete Mathematics" by Norman Biggs is widely available in print and digital formats. However, for those looking for a PDF version, it may be available online through various sources, including online libraries and bookstores. It is essential to note that downloading copyrighted material without permission is illegal and can have serious consequences.
Conclusion
In conclusion, "Discrete Mathematics" by Norman Biggs is a comprehensive textbook that provides a thorough introduction to discrete mathematics. The book covers a wide range of topics, including set theory, relations, functions, graph theory, and combinatorics. It is aimed at undergraduate students in mathematics, computer science, and related fields. The book is essential for students who want to gain a foundational understanding of discrete mathematics and its applications.
References
Further Reading
For those interested in learning more about discrete mathematics, there are several online resources available, including:
These resources provide additional learning materials, including lecture notes, assignments, and exams.
FAQs
Q: What is the publication date of the book? A: The book was published in 2002.
Q: Who is the author of the book? A: The author of the book is Norman Biggs.
Q: What is the publisher of the book? A: The publisher of the book is Oxford University Press.
Q: Is the PDF version of the book available online? A: The PDF version of the book may be available online through various sources, but downloading copyrighted material without permission is illegal.
By following this article, readers should have a comprehensive understanding of the book "Discrete Mathematics" by Norman Biggs and its significance in the field of discrete mathematics.
Norman Biggs' 2002 Discrete Mathematics (2nd Edition), published by Oxford University Press, is a foundational text providing a rigorous introduction to logic, graph theory, and algebraic methods for undergraduate students. This heavily updated edition features enhanced pedagogical structure with over 1,000 exercises and a stronger focus on algorithms. For more details, visit Oxford University Press. Discrete Mathematics - Hardback - Norman L. Biggs
Looking for a solid foundation in discrete math? Norman Biggs' Discrete Mathematics (2nd Edition)
, published by Oxford University Press in 2002, is widely considered the "gold standard" for students and self-learners alike. Why this book? Clear & Concise:
Biggs has a knack for making abstract concepts like graph theory and combinatorics feel intuitive. Logical Flow:
It bridges the gap between high school algebra and the rigorous logic required for computer science and advanced math. Broad Coverage:
You’ll find everything from sets and functions to modular arithmetic and cryptography. What’s Inside? Foundations: Logic, proof techniques, and set theory. Combinatorics: Counting principles and generating functions. Graphs and Algorithms: Trees, networks, and the basics of complexity. Algebraic Structure: Groups, rings, and their applications in coding theory.
Whether you're prepping for exams or just want to understand the math that powers modern algorithms, this is the definitive text to have on your shelf (or your drive). from the book or a summary of a specific chapter
Understanding a Cornerstone: Norman Biggs’ Discrete Mathematics (Oxford University Press)
In the realm of modern mathematics, few textbooks have achieved the "gold standard" status of Norman Biggs’ Discrete Mathematics. Originally published by Oxford University Press, the 2002 second edition remains a definitive resource for students of mathematics, computer science, and engineering.
If you are searching for this specific 2002 OUP edition, you are likely looking for one of the most lucid introductions to the structures that underpin our digital world. Why the 2002 Edition is Significant
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. Unlike calculus, which deals with smooth changes, discrete math focuses on distinct, separated values—the logic behind every computer algorithm.
Norman Biggs, an Emeritus Professor at the London School of Economics, refined the 2002 edition to bridge the gap between abstract theory and practical application. This version is particularly prized for:
Expanded Coverage: The 2002 update introduced more content on algorithms and their complexity, reflecting the growing intersection of math and CS.
Pedagogical Clarity: Biggs is renowned for his "gentle" style, moving from foundational logic and set theory to complex graph theory without losing the reader.
Modern Applications: It provides the theoretical groundwork for cryptography, coding theory, and network analysis. Core Topics Covered
The 2002 Oxford University Press edition is structured to take a student from zero to a sophisticated understanding of several key pillars:
The Language of Mathematics: Sets, functions, and relations.
Techniques: Mathematical induction, counting (combinatorics), and recursion.
Algebraic Structures: Introduction to groups, rings, and fields, which are essential for modern encryption.
Graph Theory: A massive component of the book, covering trees, paths, cycles, and planarity—essential for understanding data structures and social networks.
Number Theory: The properties of integers that make digital security possible. Searching for the "PDF" and Digital Access
While many students search for "Norman Biggs Discrete Mathematics 2002 PDF," it is important to note that this work is a copyrighted publication of Oxford University Press. How to legitimately access the text:
University Libraries: Most academic institutions provide digital access via platforms like Oxford Academic or ProQuest.
Rental & Digital Purchase: Platforms like VitalSource or Amazon Kindle often offer legal e-book versions that preserve the 2002 layout and diagrams.
Companion Websites: Oxford University Press often provides supplementary materials, including solutions and lecture slides, for verified students and instructors. The Biggs Legacy in 2024 and Beyond
Even though the mathematical world has advanced, the foundations laid out in the 2002 edition haven't changed. Whether you are prepping for a career in Software Engineering or diving into Data Science, Biggs provides the "mental scaffolding" necessary to solve complex problems.
The 2002 edition is more than just a textbook; it is a roadmap for thinking logically. It remains a recommended text at top-tier universities worldwide precisely because it teaches you not just what the math is, but how to think like a mathematician.
Norman Biggs' Discrete Mathematics (2nd Edition, 2002) , published by Oxford University Press
, is a seminal textbook designed for undergraduate students in mathematics and computer science. The book is widely recognized for its "traditional, deductive approach" that prioritizes clarity and structured learning over excessive abstraction. Amazon.com Core Structural Framework
The 2002 edition introduced significant updates to meet evolving curriculum needs, notably adding foundational chapters on logic and proof. The text is divided into thematic sections: Amazon.com The Language of Mathematics
: Covers formal foundations including statements and proofs, set notation, the logical framework, and the properties of natural numbers and integers. Techniques of Counting
: Explores principles of combinatorics, subsets, designs, and partitions. Algorithms and Graphs
: Discusses algorithm efficiency alongside graph theory, including trees, bipartite graphs, matching problems, and network flows. Algebraic Methods
: Provides an introduction to groups, rings, fields, polynomials, and their applications in areas like error-correcting codes. Mathematics Stack Exchange Key Educational Features Deductive Methodology
: Biggs uses a step-by-step layering of concepts, starting from basic arithmetic and algebraic manipulations to equip students for advanced topics. Pedagogical Tools
: The volume contains over 1,000 tailored exercises, with many solutions available through the Oxford University Press Companion Website Algorithmic Focus
: A key feature of the 2002 revision is the presentation of algorithms in a format resembling real programming languages, facilitating easier implementation for computer science students. Amazon.com Impact and Relevance
Reviewers frequently praise the text for its "fluent but rigorous style," making it approachable for those who might find more formal presentations alienating. By bridging the gap between theoretical mathematics and practical computation, it remains a "cornerstone text" for building foundational knowledge in graph theory, number theory, and abstract algebra. Amazon.com detailed breakdown of one of the chapters mentioned? Discrete Mathematics, 2nd Edition: Biggs, Norman L. Summary of Chapter 1 A set is a
The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, Amazon.com Discrete Mathematics, 2nd Edition: Biggs, Norman L.
The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, Amazon.com What is the best book for studying discrete mathematics?
Norman Biggs' Discrete Mathematics (2nd Edition) , published by Oxford University Press
in 2002, is a foundational text for students in mathematics and computer science. It is widely recognized for its clear, deductive approach that minimizes unnecessary abstraction while covering a broad range of topics from graph theory to abstract algebra. Amazon.com 1. Key Topics and Structure
The textbook is organized into four main sections, moving from fundamental language to specialized algebraic methods: Oxford University Press Part I: The Language of Mathematics
Covers logical frameworks, set notation, functions, and the properties of natural numbers and integers. Part II: Techniques
Focuses on counting principles, subsets, partitions, and modular arithmetic. Part III: Algorithms and Graphs
Explores graph theory, trees, bipartite matching, networks, flows, and recursive techniques. Part IV: Algebraic Methods
Introduces groups, rings, fields, polynomials, and applications like error-correcting codes and generating functions. Oxford University Press 2. Notable Features of the 2nd Edition New Content
: Includes expanded chapters on statements and proof, logical framework, and the properties of natural numbers. Problem Sets : Contains over 1,000 tailored exercises
with solutions to selected questions provided within the text.
: Known for being "fluent but rigorous," making it accessible to students who may find more formal presentations alienating. Waterstones 3. Essential Resources Discrete Mathematics, 2nd Edition: Biggs, Norman L.
Title: The Gold Standard: Why Norman Biggs’ Discrete Mathematics (2002) Remains a Essential Text
Every computer science student eventually reaches the "bottleneck" of their degree. It’s the moment where coding tutorials aren't enough, and the need for a deeper, structural understanding of logic takes over. This is usually where the search for the "perfect" textbook begins.
For decades, one title has consistently risen to the top of reading lists, particularly in the UK and Europe: Norman Biggs’ Discrete Mathematics, published by Oxford University Press.
While the 2002 edition (often cited as the 2nd Edition or reprints thereof) is not the newest book on the shelf, it remains a benchmark for clarity and mathematical rigor. If you have been hunting for the PDF of this specific text, or are wondering if it is worth the read in 2024, here is a deep dive into why this book matters.
If you are searching for a discrete math PDF, you have likely encountered alternatives:
If you need a digital copy:
The persistent search for Norman Biggs’ Discrete Mathematics (Oxford University Press, 2002) in PDF form testifies to the book’s enduring relevance. In an era of flashy video courses and interactive coding platforms, Biggs offers something rare: rigorous, quiet, architectural thinking. Each theorem is a brick; each proof, a mortar that leads to a building of understanding about computation itself.
While obtaining a free PDF is tempting, weigh the cost of a blurry scan, missing pages, and legal risk against the modest price of a used copy or university library access. The knowledge inside—on graphs, proofs, and algorithms—will outlive any file format. And if you eventually buy the book, you will likely keep it on your shelf long after your PDF folder has been forgotten.
Final recommendation: Search your library first. If unavailable, purchase a second-hand physical copy. Then, and only then, if you need a digital backup, scan it yourself. That way, you honor both the law and Norman Biggs’ magnificent intellectual legacy.
Keywords integrated: norman biggs discrete mathematics oxford university press -2002- pdf, discrete math textbook, graph theory, combinatorics, Oxford University Press 2002 edition, legal PDF access.
Norman Biggs' Discrete Mathematics (2002) , published by Oxford University Press, is a foundational text for students of computer science and mathematics. This second edition significantly expanded upon the original, adding essential chapters on logic and the properties of numbers to better support introductory learners. 📘 Overview of the 2002 Second Edition
The 2002 revision was developed to address shifting undergraduate needs, moving toward a more structured and coherent introduction to the subject.
Approach: It uses a traditional deductive style, focusing on rigorous mathematical reasoning and proofs.
Target Audience: Undergraduate students in Computer Science and Mathematics.
Key Addition: Nine introductory chapters under the heading 'Foundations' to ensure students understand the nature of proof and the number system. 🗂️ Core Topics & Chapters
The book is organized into several key parts that progress from basic logic to advanced algebraic structures. 1. Foundations (The Language of Mathematics) This section establishes the "grammar" of discrete math:
Statements and Proofs: Direct proof, contradiction, and induction. Logical Framework: Propositional logic and set notation.
Number Systems: Detailed exploration of natural numbers and integers.
Functions: Mapping between sets and understanding relations. 2. Techniques (Counting & Combinatorics) Focuses on how to count and arrange discrete objects:
Principles of Counting: Permutations, combinations, and the inclusion-exclusion principle.
Subsets and Designs: How to select and organize data into specific structures.
Modular Arithmetic: The foundation for many computer algorithms and cryptography. 3. Algorithms and Graphs Essential for computer science applications: Set theory
Norman Biggs' Discrete Mathematics (2nd Edition, 2002), published by Oxford University Press
, is a cornerstone textbook for undergraduate students in mathematics and computer science. This edition was specifically redesigned to meet evolving undergraduate curricula and includes over 1,000 tailored exercises to reinforce learning. Google Books Core Content and Structure
The textbook is organized into four primary sections that build from foundational logic to complex algebraic structures: Oxford University Press The Language of Mathematics
: Covers fundamental concepts including statements and proofs, set notation, the logical framework, natural numbers, functions, and prime numbers. Techniques
: Focuses on counting principles, subsets, partitions, and modular arithmetic. Algorithms and Graphs
: Explores the efficiency of algorithms, graph theory, trees, sorting, searching, and recursive techniques. Algebraic Methods
: Delves into advanced topics like group theory, rings, fields, finite fields, and error-correcting codes. Oxford University Press Key Features of the 2nd Edition
Released in late 2002, this version introduced significant updates to the original 1985 text: Google Books New Introductory Chapters
: Added specific sections on statements and proof, logical framework, and natural numbers to better support students new to the subject. Algorithmic Focus
: Algorithms are presented in a format closely resembling real programming languages, helping computer science students bridge the gap between design and implementation. Comprehensive Resources : The textbook is supported by a companion website which provides hints and solutions to every exercise. Google Books Educational Significance
The book is highly regarded for its clear, deductive approach and its ability to serve both mathematics and computer science disciplines. It is frequently cited in university syllabi—such as the University of Cambridge
—for teaching the foundations of algorithms, cryptography, and formal proof. Google Books practice problems or a more detailed breakdown of a particular Discrete Mathematics - Norman Biggs - Google Books
The second edition of Discrete Mathematics Norman L. Biggs , published by Oxford University Press
in 2002, is a comprehensive textbook designed for undergraduate students in mathematics and computer science. It expanded upon previous editions with new foundations in logic and number theory, covering a broad spectrum from graph theory to abstract algebra. Oxford University Press Quick Facts Publisher: Oxford University Press Publication Date: December 2002 (UK/International); February 2003 (US) 978-0198507178 Page Count: Approximately 442 pages Key New Content:
Additional chapters on statements and proof, the logical framework, natural numbers, and integers. Google Books Core Themes & Contents
The textbook is structured into major thematic sections that bridge theoretical mathematics with computational applications: Oxford University Press The Language of Mathematics:
Foundations including statements and proofs, set notation, logical frameworks, and the properties of natural numbers and integers. Techniques & Counting:
Principles of counting, subsets and designs, partition and distribution, and modular arithmetic. Algorithms & Graphs:
Analysis of algorithmic efficiency, graph theory, trees (sorting/searching), bipartite graphs, networks, and recursive techniques. Algebraic Methods:
Introduction to group theory, rings, fields, polynomials, and their applications in error-correcting codes and symmetry. Google Books Discrete Mathematics - Norman Biggs - Google Books discrete math textbook
Published: Oxford University Press, 2nd Edition, 2002
Author: Norman L. Biggs (Emeritus Professor, London School of Economics)