Author: Martin Aigner

Publisher: American Mathematical Soc.

ISBN: 9780821886151

Category: Mathematics

Page: 388

View: 7816

Skip to content
# Nothing Found

### Discrete Mathematics

The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints andsolutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level. Praise for the German edition ... This book is a well-written introduction to discrete mathematics and is highly recommended to every student ofmathematics and computer science as well as to teachers of these topics. --Konrad Engel for MathSciNet Martin Aigner is a professor of mathematics at the Free University of Berlin. He received his PhD at the University of Vienna and has held a number of positions in the USA and Germany before moving to Berlin. He is the author of several books on discrete mathematics, graph theory, and the theory of search. The Monthly article Turan's graph theorem earned him a 1995 Lester R. Ford Prize of theMAA for expository writing, and his book Proofs from the BOOK with Gunter M. Ziegler has been an international success with translations into 12 languages.

### Discrete Mathematics

Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to help students understand the solutions to problems. Numerous examples, figures, and exercises are spread throughout the book.

### Discrete Mathematics: Introduction to Mathematical Reasoning

Susanna Epp's DISCRETE MATHEMATICS: AN INTRODUCTION TO MATHEMATICAL REASONING, provides the same clear introduction to discrete mathematics and mathematical reasoning as her highly acclaimed DISCRETE MATHEMATICS WITH APPLICATIONS, but in a compact form that focuses on core topics and omits certain applications usually taught in other courses. The book is appropriate for use in a discrete mathematics course that emphasizes essential topics or in a mathematics major or minor course that serves as a transition to abstract mathematical thinking. The ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. This book offers a synergistic union of the major themes of discrete mathematics together with the reasoning that underlies mathematical thought. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision, helping students develop the ability to think abstractly as they study each topic. In doing so, the book provides students with a strong foundation both for computer science and for other upper-level mathematics courses. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.

### Discrete Mathematics

Taking an approach to the subject that is suitable for a broad readership, Discrete Mathematics: Proofs, Structures, and Applications, Third Edition provides a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science. The approach is comprehensive yet maintains an easy-to-follow progression from the basic mathematical ideas to the more sophisticated concepts examined later in the book. This edition preserves the philosophy of its predecessors while updating and revising some of the content. New to the Third Edition In the expanded first chapter, the text includes a new section on the formal proof of the validity of arguments in propositional logic before moving on to predicate logic. This edition also contains a new chapter on elementary number theory and congruences. This chapter explores groups that arise in modular arithmetic and RSA encryption, a widely used public key encryption scheme that enables practical and secure means of encrypting data. This third edition also offers a detailed solutions manual for qualifying instructors. Exploring the relationship between mathematics and computer science, this text continues to provide a secure grounding in the theory of discrete mathematics and to augment the theoretical foundation with salient applications. It is designed to help readers develop the rigorous logical thinking required to adapt to the demands of the ever-evolving discipline of computer science.

### Discrete Mathematics

The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics includes new chapters on statements and proof, logical framework, natural numbers and the integers, in addition to updated chapters from the previous edition. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra.Key Features:* Contains nine new introductory chapters, in addition to updated chapters from the previous edition* Contains over 1000 individual exercises and selected solutions* Companion website www.oup.com/mathematics/discretemath contains hints and solutions to all exercisesContents:The Language of Mathematics1. Statements and proofs2. Set notation3. The logical framework4. Natural numbers5. Functions6. How to count 7. Integers8. Divisibility and prime numbers9. Fractions and real numbersTechniques10. Principles of counting11. Subsets and designs12. Partition, classification and distribution13. Modular arithmeticAlgorithms and Graphs14. Algorithms and their efficiency15. Graphs16. Trees, sorting and searching17. Bipartite graphs and matching problems18. Digraphs, networks and flows19. Recursive techniquesAlgebraic Methods20. Groups21. Groups of permutations22. Rings, fields and polynomials23. Finite fields and some applications24. Error-correcting codes25. Generating functions26. Partitions of a positive integer27. Symmetry and counting

### Computational Discrete Mathematics

This book was first published in 2003. Combinatorica, an extension to the popular computer algebra system Mathematica®, is the most comprehensive software available for teaching and research applications of discrete mathematics, particularly combinatorics and graph theory. This book is the definitive reference/user's guide to Combinatorica, with examples of all 450 Combinatorica functions in action, along with the associated mathematical and algorithmic theory. The authors cover classical and advanced topics on the most important combinatorial objects: permutations, subsets, partitions, and Young tableaux, as well as all important areas of graph theory: graph construction operations, invariants, embeddings, and algorithmic graph theory. In addition to being a research tool, Combinatorica makes discrete mathematics accessible in new and exciting ways to a wide variety of people, by encouraging computational experimentation and visualization. The book contains no formal proofs, but enough discussion to understand and appreciate all the algorithms and theorems it contains.

### Discrete Mathematics in the Schools

This book provides teachers of all levels with a great deal of valuable material to help them introduce discrete mathematics into their classrooms.

### Introductory Discrete Mathematics

This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.

### A First Course in Discrete Mathematics

Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.

### Discrete mathematics

### Discrete Mathematics

### Computational Support for Discrete Mathematics

With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing general-purpose software and integrated software systems for domains in discrete mathematics, including graph theory, combinatorics, combinatorial optimization, and sets. This software aims to provide effective computational tools for research, applications prototyping, and teaching. In March 1992, DIMACS sponsored a workshop on Computational Support for Discrete Mathematics in order to facilitate interactions between the researchers, developers, and educators who work in these areas. Containing refereed papers based on talks presented at the workshop, this volume documents current and past research in these areas and should provide impetus for new interactions.

### Discrete Mathematics with Applications

Susanna Epp's DISCRETE MATHEMATICS WITH APPLICATIONS, FOURTH EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.

### Discrete Mathematics

This book offers an introduction to mathematical proofs and to the fundamentals of modern mathematics. No real prerequisites are needed other than a suitable level of mathematical maturity. The text is divided into two parts, the first of which constitutes the core of a one-semester course covering proofs, predicate calculus, set theory, elementary number theory, relations, and functions, and the second of which applies this material to a more advanced study of selected topics in pure mathematics, applied mathematics, and computer science, specifically cardinality, combinatorics, finite-state automata, and graphs. In both parts, deeper and more interesting material is treated in optional sections, and the text has been kept flexible by allowing many different possible courses or emphases based upon different paths through the volume.

### Discrete Mathematics with Applications

This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation. * Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations * Weaves numerous applications into the text * Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects * Includes chapter summaries of important vocabulary, formulas, and properties, plus the chapter review exercises * Features interesting anecdotes and biographies of 60 mathematicians and computer scientists * Instructor's Manual available for adopters * Student Solutions Manual available separately for purchase (ISBN: 0124211828)

### Discrete Mathematics for New Technology, Second Edition

Updated and expanded, Discrete Mathematics for New Technology, Second Edition provides a sympathetic and accessible introduction to discrete mathematics, including the core mathematics requirements for undergraduate computer science students. The approach is comprehensive yet maintains an easy-to-follow progression from the basic mathematical ideas to the more sophisticated concepts examined in the latter stages of the book. Although the theory is presented rigorously, it is illustrated by the frequent use of pertinent examples and is further reinforced with exercises-some with hints and solutions-to enable the reader to achieve a comprehensive understanding of the subject at hand. New to the Second Edition Numerous new examples and exercises designed to illustrate and reinforce mathematical concepts and facilitate students' progression through the topics New sections on typed set theory and an introduction to formal specification Presenting material that is at the foundations of mathematics itself, Discrete Mathematics for New Technology is a readable, friendly textbook designed for non-mathematicians as well as for computing and mathematics undergraduates alike.

### Resources for Teaching Discrete Mathematics

Resources for Teaching Discrete Mathematics presents nineteen classroom tested projects complete with student handouts, solutions, and notes to the instructor. Topics range from a first day activity that motivates proofs to applications of discrete mathematics to chemistry, biology, and data storage. Other projects provide: supplementary material on classic topics such as the towers of Hanoi and the Josephus problem, how to use a calculator to explore various course topics, how to employ Cuisenaire rods to examine the Fibonacci numbers and other sequences, and how you can use plastic pipes to create a geodesic dome. The book contains eleven history modules that allow students to explore topics in their original context. Sources range from eleventh century Chinese figures that prompted Leibniz to write on binary arithmetic, to a 1959 article on automata theory. Excerpts include: Pascal's "Treatise on the Arithmetical Triangle," Hamilton's "Account of the Icosian Game," and Cantor's (translated) "Contributions to the Founding of the Theory of Transfinite Numbers." Five articles complete the book. Three address extensions of standard discrete mathematics content: an exploration of historical counting problems with attention to discovering formulas, a discussion of how computers store graphs, and a survey connecting the principle of inclusion-exclusion to Möbius inversion. Finally, there are two articles on pedagogy specifically related to discrete mathematics courses: a summary of adapting a group discovery method to larger classes, and a discussion of using logic in encouraging students to construct proofs.

### Essentials of Discrete Mathematics

Essentials of Discrete Mathematics, Second Edition is the ideal text for a one-term discrete mathematics course to serve computer science majors as well as students from a wide range of other disciplines. It introduces students to the mathematical way of thinking, and also to many important modern applications. The material is organized around five types of thinking: logical, relational, recursive, quantitative, and analytical. This presentation results in a coherent outline that steadily builds upon mathematical sophistication. Graphs are introduced early and referred to throughout the text, providing a richer context for examples and applications. Students will encounter algorithms near the end of the text, after they have acquired the skills and experience needed to analyze them. The final chapter contains in-depth case studies from a variety of fields, including biology, sociology, linguistics, economics, and music. Clear and concise, Essentials of Discrete Mathematics presents a unified and complete picture of discrete mathematics that instructors can cover in a single semester.

### Discrete Mathematics

Discrete mathematics is the basic language which every student of computing should take pride in mastering and this book should prove an essential tool in this aim.

### Foundations of Discrete Mathematics

This Book Is Meant To Be More Than Just A Text In Discrete Mathematics. It Is A Forerunner Of Another Book Applied Discrete Structures By The Same Author. The Ultimate Goal Of The Two Books Are To Make A Strong Case For The Inclusion Of Discrete Mathematics In The Undergraduate Curricula Of Mathematics By Creating A Sequence Of Courses In Discrete Mathematics Parallel To The Traditional Sequence Of Calculus-Based Courses.The Present Book Covers The Foundations Of Discrete Mathematics In Seven Chapters. It Lays A Heavy Emphasis On Motivation And Attempts Clarity Without Sacrificing Rigour. A List Of Typical Problems Is Given In The First Chapter. These Problems Are Used Throughout The Book To Motivate Various Concepts. A Review Of Logic Is Included To Gear The Reader Into A Proper Frame Of Mind. The Basic Counting Techniques Are Covered In Chapters 2 And 7. Those In Chapter 2 Are Elementary. But They Are Intentionally Covered In A Formal Manner So As To Acquaint The Reader With The Traditional Definition-Theorem-Proof Pattern Of Mathematics. Chapters 3 Introduces Abstraction And Shows How The Focal Point Of Todays Mathematics Is Not Numbers But Sets Carrying Suitable Structures. Chapter 4 Deals With Boolean Algebras And Their Applications. Chapters 5 And 6 Deal With More Traditional Topics In Algebra, Viz., Groups, Rings, Fields, Vector Spaces And Matrices.The Presentation Is Elementary And Presupposes No Mathematical Maturity On The Part Of The Reader. Instead, Comments Are Inserted Liberally To Increase His Maturity. Each Chapter Has Four Sections. Each Section Is Followed By Exercises (Of Various Degrees Of Difficulty) And By Notes And Guide To Literature. Answers To The Exercises Are Provided At The End Of The Book.

Full PDF eBook Download Free

Author: Martin Aigner

Publisher: American Mathematical Soc.

ISBN: 9780821886151

Category: Mathematics

Page: 388

View: 7816

*Elementary and Beyond*

Author: László Lovász,József Pelikán,Katalin Vesztergombi

Publisher: Springer Science & Business Media

ISBN: 0387217770

Category: Mathematics

Page: 284

View: 7211

Author: Susanna S. Epp

Publisher: Cengage Learning

ISBN: 0495826170

Category: Mathematics

Page: 648

View: 3442

*Proofs, Structures and Applications, Third Edition*

Author: Rowan Garnier,John Taylor

Publisher: CRC Press

ISBN: 1439812802

Category: Mathematics

Page: 843

View: 4922

Author: Norman Biggs

Publisher: Oxford University Press

ISBN: 9780198507178

Category: Computers

Page: 425

View: 3746

*Combinatorics and Graph Theory with Mathematica ®*

Author: Sriram Pemmaraju,Steven Skiena

Publisher: Cambridge University Press

ISBN: 1107268710

Category: Computers

Page: N.A

View: 4637

Author: Joseph G. Rosenstein

Publisher: American Mathematical Soc.

ISBN: 9780821885789

Category: Mathematics

Page: 452

View: 4226

Author: V. K . Balakrishnan

Publisher: Courier Corporation

ISBN: 0486140385

Category: Mathematics

Page: 256

View: 6031

Author: Ian Anderson

Publisher: Springer Science & Business Media

ISBN: 085729315X

Category: Mathematics

Page: 200

View: 6344

Author: Kenneth A. Ross,Charles R. B. Wright

Publisher: Prentice Hall

ISBN: N.A

Category: Mathematics

Page: 610

View: 2653

Author: T. Veerarajan

Publisher: Tata McGraw-Hill Education

ISBN: 9780070616783

Category: Combinatorial analysis

Page: 531

View: 7045

*DIMACS Workshop, March 12-14, 1992*

Author: Nathaniel Dean,Gregory E. Shannon

Publisher: American Mathematical Soc.

ISBN: 9780821870617

Category: Mathematics

Page: 399

View: 3362

Author: Susanna S. Epp

Publisher: Cengage Learning

ISBN: 0495391328

Category: Mathematics

Page: 984

View: 2973

*Proof Techniques and Mathematical Structures*

Author: R. C. Penner

Publisher: World Scientific

ISBN: 9789810240882

Category: Computers

Page: 469

View: 909

Author: Thomas Koshy

Publisher: Elsevier

ISBN: 9780080477343

Category: Mathematics

Page: 1042

View: 6546

Author: Rowan Garnier,John Taylor

Publisher: CRC Press

ISBN: 9781420056983

Category: Mathematics

Page: 749

View: 8381

*Classroom Projects, History Modules, and Articles*

Author: Brian Hopkins

Publisher: MAA

ISBN: 9780883851845

Category: Mathematics

Page: 323

View: 2140

Author: David J. Hunter

Publisher: Jones & Bartlett Publishers

ISBN: 1449604420

Category: Computers

Page: 488

View: 1372

*An Introduction for Software Engineers*

Author: Mike Piff

Publisher: Cambridge University Press

ISBN: 9780521386227

Category: Computers

Page: 317

View: 2973

Author: K. D. Joshi

Publisher: New Age International

ISBN: 9788122401202

Category: Combinatorial analysis

Page: 748

View: 6841