Foundations of Discrete Mathematics

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): K. D. Joshi
Edition: 1991 reprint
Publisher: Wiley
Year: 1991

Language: English

Title
List of Standard Symbols
Suggested Course Coverage
Preface
Contents
One. Introduction and Preliminaries
1. What is Discrete Mathematics?
2. Typical Problems
3. Comments about Typical Problems
4. Review of Logic
Two. Elementary Counting Techniques
1. Sets and Functions
2. Cardinalities of Sets
3. Applications to Counting Problems
4. Principle of Inclusion and Exclusion
Three. Sets with Additional Structures
1. Abstraction and Mathematical Structures
2. Binary Relations on Sets
3. Order Relations
4. Algebraic Structures
Four. Boolean Algebras
1. Deļ¬nition and Properties
2. Boolean Functions
3. Applications to Switching Networks
4. Applications to Logic
Five. Group Theory
1. Groups and Subgroups
2. Cosets of Subgroups
3. Group Homomorphisms
4. Permutation Groups
Six. Rings, Fields and Vector Spaces
1. Basic Concepts and Examples
2. Special Types of Integral Domains
3. Vector Spaces
4. Matrices and Determinants
Seven. Advanced Counting Techniques
1. Generating Functions of Sequences
2. Application to Enumeration Problems
3. Recurrence Relations
4. Applications of Recurrence Relations
Epilogue: Preview of "Applied Discrete Structures"
References
Answers to Exercises
to Chapter 1
to Chapter 2
to Chapter 3
to Chapter 4
to Chapter 5
to Chapter 6
to Chapter 7
Index