《离散数学结构(第6版)(影印版)》先后改进五版，历经25年，受到广泛认可，这使我们感到非常欣慰。同样欣喜的是《离散数学结构(第6版)(影印版)》前五版所选的内容及解题方法也被广泛肯定。例如，最近协会和其他机构都大力推荐该书作为离散结构的一学期的课程。在该版筹划前，我们充分考虑了来自教师和学生的众多建议和意见以改进《离散数学结构(第6版)(影印版)》的内容和材料。尽管该版做了改进并完善了很多，但是我们的目标依然同前五版一样：以一种简明的、学生能够理解的方式来介绍离散数学的基本概念及其某些应用。
目录
PrefaceA Word to Students1 Fundamentals l.1 Sets and Subsets 1.2 Operations on Sets 1.3 Sequences 1.4 Properties of Integers 1.5 Matrices 1.6 Mathematical Structures2 Logic 2.1 Propositions and Logical Operations 2.2 Conditional Statements 2.3 Methods of Proof 2.4 Mathematical Induction 2.5 Mathematical Statements 2.6 Logic and Problem Solving3 Counting 3.1 Permutations 3.2 Combinations 3.3 Pigeonhole Principle 3.4 Elements of Probability 3.5 Recurrence Relations4 Relations and Digraphs 4.1 Product Sets and Partitions 4.2 Relations and Digraphs 4.3 Paths in Relations and Digraphs 4.4 Properties of Relations 4.5 Equivalence Relations 4.6 Data Structures for Relations and Digraphs 4.7 Operations on Relations 4.8 Transitive Closure and Warshall's Algorithm5 Functions 5.1 Functions 5.2 Functions for Computer Science 5.3 Growth of Functions 5.4 Permutation Functions6 Order Relations and Structures 6.1 Partially Ordered Sets 6.2 Ex.tremal Elements of Partially Ordered Sets 6.3 Lattices 6.4 Finite Boolean, Algebras 6.5 Functions on Boolean Algebras 6.6 Circuit Design7 Trees 7.1 Trees 7.2 Labeled Trees 7.3 Tree Searching 7.4 Undirected Trees 7.5 Minimal Spanning Trees8 Topics in Graph Theory 8.1 Graphs 8.2 Euler Paths and Circuits 8.3 Hamiltonian Paths and Circuits 8.4 Transport Networks 8.5 Matching Problems 8.6 Coloring Graphs9 Semigroups and Groups 9.1 Binary Operations Revisited 9.2 Semigroups 9.3 Products and Quotients of Semigroups 9.4 Groups 9.5 Products and Quotients of Groups 9.6 Other Mathematical Structures10 Languages and Finite-State Machines 10.1 Languages 10.2 Representations of Special Grammars and Languages 10.3 Finite-State Machines 10.4 Monoids, Machines, and Languages 10.5 Machines and Regular Languages 10.6 Simplification of Machines11 Groups and Coding 11.1 Coding of Binary Information and Error Detection 11.2 Decoding and Error Correction 11.3 Public Key CryptologyAppendix A: Algorithms and PseudocodeAppendix B: Additional Experiments in Discrete MathematicsAppendix C: Coding ExercisesAnswers to Odd-Numbered ExercisesAnswers to Chapter Self-TestsGlossary G-1Index 1-1Photo Credits P-1
PrefaceA Word to Students1 Fundamentals l.1 Sets and Subsets 1.2 Operations on Sets 1.3 Sequences 1.4 Properties of Integers 1.5 Matrices 1.6 Mathematical Structures2 Logic 2.1 Propositions and Logical Operations 2.2 Conditional Statements 2.3 Methods of Proof 2.4 Mathematical Induction 2.5 Mathematical Statements 2.6 Logic and Problem Solving3 Counting 3.1 Permutations 3.2 Combinations 3.3 Pigeonhole Principle 3.4 Elements of Probability 3.5 Recurrence Relations4 Relations and Digraphs 4.1 Product Sets and Partitions 4.2 Relations and Digraphs 4.3 Paths in Relations and Digraphs 4.4 Properties of Relations 4.5 Equivalence Relations 4.6 Data Structures for Relations and Digraphs 4.7 Operations on Relations 4.8 Transitive Closure and Warshall's Algorithm5 Functions 5.1 Functions 5.2 Functions for Computer Science 5.3 Growth of Functions 5.4 Permutation Functions6 Order Relations and Structures 6.1 Partially Ordered Sets 6.2 Ex.tremal Elements of Partially Ordered Sets 6.3 Lattices 6.4 Finite Boolean, Algebras 6.5 Functions on Boolean Algebras 6.6 Circuit Design7 Trees 7.1 Trees 7.2 Labeled Trees 7.3 Tree Searching 7.4 Undirected Trees 7.5 Minimal Spanning Trees8 Topics in Graph Theory 8.1 Graphs 8.2 Euler Paths and Circuits 8.3 Hamiltonian Paths and Circuits 8.4 Transport Networks 8.5 Matching Problems 8.6 Coloring Graphs9 Semigroups and Groups 9.1 Binary Operations Revisited 9.2 Semigroups 9.3 Products and Quotients of Semigroups 9.4 Groups 9.5 Products and Quotients of Groups 9.6 Other Mathematical Structures10 Languages and Finite-State Machines 10.1 Languages 10.2 Representations of Special Grammars and Languages 10.3 Finite-State Machines 10.4 Monoids, Machines, and Languages 10.5 Machines and Regular Languages 10.6 Simplification of Machines11 Groups and Coding 11.1 Coding of Binary Information and Error Detection 11.2 Decoding and Error Correction 11.3 Public Key CryptologyAppendix A: Algorithms and PseudocodeAppendix B: Additional Experiments in Discrete MathematicsAppendix C: Coding ExercisesAnswers to Odd-Numbered ExercisesAnswers to Chapter Self-TestsGlossary G-1Index 1-1Photo Credits P-1
|
