《离散数学结构(第三版)--英文》是1997-12清华大学出版社出版的图书。

• 作者 (美)科尔曼 / 等
• 出版社 清华大学出版社
• 出版时间 1997年12月
• 页数 524 页
• 定价 32.00

内容介绍

　　内容简介

　　用于计算机科学的离散数学是大学一、二年级�难教又难学的一门课程。本书深入浅出，由简及繁，将定义和理论抽象压缩到最低限度。除仍像前两版那样以关系和有来自向图作为中心外，本书增加了较大的灵活性和模块性。360百科本书11章分别为:基础;逻黑拿含反氢工钟转辑;计数;关系和有向图;函数;图论问题;有序关系及结构;树;半规群和群;语言和有限状态机;群和编码。除新增损川帮道烧采一章图论外，还增加了一些新证强掌分的小节如:数学结构药食古抓包鱼权标兰，谓词演算，递归关系，用于计算机科学的函数，函数的序，最小生成树。附录B离散数学实验是新增加的;此外，有关递归、逻辑及验证也引入了更多的境状造新材料，排列和组合局费种系装探块块的表达形式有了扩展，每章都增加了编码练习。本书既可作数学也可作计算机科学或计算机工程课的教材。

作者介绍

　　Bernard Kolman received his B.S. (summa cum laude w感自怀生间分士吧火苦染ith honors in mathemat-

　　ics 著至谁场材扩处and physics) from Brooklyn 可固源轮College in 1954, his Sc.M. from Brown University

　　in 1956, and his Ph.D. from the Univer雷他地四河孙sity of Pennsylvania in 1965, all in mathe-

　　matics. During the summers of 1955 and 1956 he worked as a mathematician for

　　the U.S. Navy, and IBM, respectively, in areas of numerical analysis a少苦食语蛋族室nd simula-

　　tion. From 1957-1964, he was employed as a mathematician by the UNIVAC

　　D土十ivision of Sperry Rand Corporation, working in the areas of operations

　　research, numerical analysis, and discrete mathematics. He also had extensive

　　experience as.a consultant to industry in operations research. Sinc资愿创菜动初落究e 1964, he has

　　been a member of the Mathematics Department at Drexel University, where he

　　also served as Ac剧演食ting Head of t意移耐动业笑章亚his department. Since 1964, his research activities

　　h则原ave been in the areas of Lie algebras and operations r何esearch.

　　Professor Kolman is the author of numerous papers, primarily in Lie alge-

　　bras, and has organized several conferences on Lie algebras. He is also well

　　known as the author of many mathematics textbooks that are used worldwide

　　and have been translated into several other languages. He belongs to a number

　　of professional associations and is a member of Phi Beta Kappa, Pi Mu Epsi'.on,

　　and Sigma Xi.

　　Robert C. Busby received his B.S. in Physics from Drexel University in 1963 and

　　his A.M. in 1964 and Ph.D. in 1966, both in mathematics from the University of

　　Pennsylvania. From September 1967 to May 1969 he was a member of the math-

　　ematics department at Oakland University in Rochester, Michigan. Since 1969 he

　　has been a faculty member at Drexel University, in what is now the Department

　　of Mathematics and Computer Science. He has consulted in applied mathemat-

　　ics in industry and government. This includes a period of three years as a consul-

　　tant to the Office of Emergency Preparedness, Executive Office of the President,

　　specializing in applications of mathematics to economic problems. He has had

　　extensive experience developing computer implementations of a variety of math-

　　ematical applications.

　　Professor Busby has written two books and has numerous research papers

　　in operator algebras, group representations, operator continued fractions, and the

　　applications of probability and statistics to mathematical demography.

　　Sharon Cutler Ross received an S.B. in mathematics from the Massachusetts

　　Institute of Technology (1965), an M.A.T. in secondary mathematics from

　　Harvard University (1966), and a Ph.D. also in mathematics from Emory

　　University (1976). In addition, she is a graduate of the Institute for Retraining in

　　Computer Science (1984). She has taught junior high, high school, and college

　　mathematics. She has also taught computer science at the collegiate level. Since

　　1974, she has been a member of the Department of Mathematics at DeKalb

　　College. Her current professional interests are in the areas of undergraduate

　　mathematics education reform and alternative forms of assessment.

　　Professor Ross is the co-author of two other mathematics textbooks. She is

　　well known for her activities with the Mathematical Association of America, the

　　American Mathematical Association of Two -Year Colleges, and UME Trends. In

　　addition, she is a full member of Sigma Xi and of numerous other professional

　　associations.

作品目录

　　CONTENTS

　　Preface

　　Fundamental来自s

　　1.1 Sets and Subsets

　　1.2 Operations on Sets

　　1.3 Sequences

　　1.4 Divisio360百科n in the Integers

　　1.5 Matrices

　　1.6 Mathematical Structures

　　Logic

　　2住态居才光.1 Propositi个波推球愿展ons and Lo率每远振数该宗妈林gical Operations

　　2.2 Conditional Stateme办复显术府范解车致肥细nts

　　2.3 Methods of Proof

　　2.4 Mathematical Induction

　　Counting

　　3.1 Permutations

　　3.2 Combinations

　　3.3 The Pigeonhole Principle

　　3.4 Elements of Probability

　　3任影明.5 Recurrence Relations

　　Relation烧把化妒笔s 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 Computer Representation of Relations and Digraphs

　　4.7 Manipulation of Relations

　　4.8 Transitive Closure and Warshall's Algorit夜协图终团除妒五首黄诉hm

　　Functions

　　管充节积许权教大石程田5.1 Functions

　　5元威体五无未测.2 Functio日逐队肉精黄述频环革希ns for Comp核uter Science

　　5.3 Permutation Functions

　　5.4 Growth of Functi土ons

　　Topics in Graph Theory

　　6.1 Graphs

　　6.2 Euler Paths and Circuits

　　6.3 Hamiltonian Paths and Circuits

　　6.4 Coloring Graphs

　　争凯花Order Relations and Structures

　　7.1 Partially Ordered Sets

　　7.2 Extremal Elements of Partially Orde河决油请求南他red Sets

　　7.3 Lattices

　　7.4 Finite Boolean Al岁胡伤律娘掉船架防丰gebras

　　7.5 Functions on Boolean Algebras

　　7.6 Boolean Functions as Boolean Polynomials

　　Trees

　　8.1 Tree质你福穿求重和茶言便s

　　8.2 Labeled Trees

　　8.3 Tr议ee Searehing

　　8.4 Undirected Trees

　　8.5 Minimal Spanning Trees

　　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

　　Languages and Finite-State Machines

　　10.1 Languages

　　10.2 Representations of Special Languages and Grammars

　　10.3 Finite-State Machines 391

　　10.4 Semigroups, Machines, and Languages

　　10.5 Machines and Regular Languages

　　10.6 Simplification of Machines

　　Groups and Coding 420

　　11.1 Coding of Binary Information and Error Detection

　　11.2 Decoding and Error Correction

　　Appendix A Algorithms and Pseudocode

　　Appendix B Experiments in Discrete Mathematics

　　Answers to Odd-Numbered Exercises

　　Index