Invitation to discrete mathematics
著者
書誌事項
Invitation to discrete mathematics
Clarendon Press , Oxford University Press, 1998
- : hbk
- : pbk
大学図書館所蔵 件 / 全39件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
- 巻冊次
-
: pbk ISBN 9780198502074
内容説明
This book is a clear and self-contained introduction to discrete mathematics, and in particular to combinatories and graph theory. Aimed at undergraduate and early graduate students in mathematics and computer science, it is written with the goal of stimulating interest in mathematics and provides an active, problem-solving approach to the material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics. It is more narrowly focused than many discrete mathematics textbooks and treats selected topics in unusual depth and from several points of view. The book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits, invariably useful for attacking new problem. More than 400 exercises, ranging widely in difficulty and many accompanied by hints for solution, support this approach to teaching. Readers will appreciate the lively and informal style of the text, accompanied by more than 200 drawings and diagrams.
Specialists in various parts of science with a basic mathematical education wishing to apply discrete mathematics in their field can use the book as a useful source, and even experts in combinatories may occasionally learn from pointers to research literature or from the presentation of recent results. "Invitation to Discrete Mathematics" should make delightful reading both for beginners and for mathematical professionals. The main topics include: elementary counting problems, asymptotic estimates, basic graph theory and graph algorithms, finite projective planes, elementary probability and the probabilistic method, generating functions, and combinatorial applications of linear algebra. General mathematical notions beyond high-school level are thoroughly explained in the introductory chapter. An appendix summarizes the undergraduate algebra needed in some of the more advanced sections of the book.
目次
- 1. Introduction and basic concepts
- 2. Combinatorial counting
- 3. Graphs: an introduction
- 4. Trees
- 5. Drawing graphs in the plane
- 6. Double-counting
- 7. The number of spanning trees
- 8. Finite projective planes
- 9. Probability and probabilistic proofs
- 10. Generating functions
- 11. Applications of linear algebra
- Appendix: Prerequisites from algebra
- Bibliography
- Hints to selected exercises
- Index
- 巻冊次
-
: hbk ISBN 9780198502081
内容説明
This book is a clear and self-contained introduction to discrete mathematics, and in particular to combinatorics and graph theory. Aimed at undergraduates and early graduate students in mathematics and computer science, it is written with the goal of stimulating interest in mathematics and encourages an active, problem-solving approach to the material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics. It is more narrowly focused than many discrete mathematics textbooks and treats selected topics in unusual depth and from several points of view. The book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits, invariably useful for attacking new problems. More than 400 exercises, ranging widely in difficulty, and many accompanied by hints for solution, support this approach to teaching. Readers will appreciate the lively and informal style of the text, accompanied by more than 200 drawings and diagrams.
Specialists in various parts of science ( with a basic mathematical education) wishing to apply discrete mathematics in their field will find the book a useful source, and even experts in combinatorics may occasionally learn from pointers to research literature or from the presentation of recent results. Invitation to Discrete Mathematics should make delightful reading both for beginners and mathematical professionals.
目次
- 1. Introduction and basic concepts
- 2. Combinatorial counting
- 3. Graphs: an introduction
- 4. Trees
- 5. Drawing graphs in the plane
- 6. Double-counting
- 7. The number of spanning trees
- 8. Finite projective planes
- 9. Probability and probabilistic proofs
- 10. Generating functions
- 11. Applications of linear algebra
- Appendix: Prerequisites from algebra
- Bibliography
- Hints to selected exercises
- Index
「Nielsen BookData」 より
