- Table View
- List View
Discrete Mathematics With Applications
by Susanna S. EppDISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. <p><p>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 today's science and technology.
Discrete Mathematics With Applications
by Susanna S. EppDISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. <p><p>Author Susanna Epp 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 today's science and technology.
Discrete Mathematics and Applications (Springer Optimization and Its Applications #165)
by Michael Th. Rassias Andrei M. RaigorodskiiAdvances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.
Discrete Mathematics and Applications, Second Edition (Textbooks in Mathematics)
by Kevin FerlandThis book is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms.
Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide (Undergraduate Topics in Computer Science)
by K. ErciyesThis textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula. The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.
Discrete Mathematics and Its Applications
by Kenneth H. RosenRosen's Discrete Mathematics and its Applications presents a precise, relevant, comprehensive approach to mathematical concepts. This world-renowned best-selling text was written to accommodate the needs across a variety of majors and departments, including mathematics, computer science, and engineering. As the market leader, the book is highly flexible, comprehensive and a proven pedagogical teaching tool for instructors. Digital is becoming increasingly important and gaining popularity, crowning Connect as the digital leader for this discipline. <p><p>McGraw-Hill Education's Connect, available as an optional, add on item. Connect is the only integrated learning system that empowers students by continuously adapting to deliver precisely what they need, when they need it, how they need it, so that class time is more effective. Connect allows the professor to assign homework, quizzes, and tests easily and automatically grades and records the scores of the student's work. Problems are randomized to prevent sharing of answers and may also have a "multi-step solution" which helps move the students' learning along if they experience difficulty.
Discrete Mathematics and Its Applications Seventh Edition
by Kenneth H. RosenDiscrete Mathematics and Its Applications, Seventh Edition, is intended for one or two term introductory Discrete Mathematics courses taken by students from a wide variety of majors, including Computer Science, Mathematics, and Engineering.
Discrete Mathematics and Mathematical Modelling in the Digital Era: ICDM3DE-2023, Gandhigram, India, March 23–25 (Springer Proceedings in Mathematics & Statistics #458)
by P. Balasubramaniam P. Raveendran G. Mahadevan K. RatnaveluThis book features carefully selected research papers presented during the 9th International Conference on Discrete Mathematics and Mathematical Modelling in the Digital Era (ICDMMMDE-2023). The conference, organised at the Department of Mathematics, The Gandhigram Rural Institute in Gandhigram, Tamil Nadu, India, took place from 23–25 March 2023. Serving as a dynamic platform, the event attracted emerging researchers, mathematicians, industrialists, scientists, and engineers from across the globe, fostering discussions on pertinent research topics. This volume showcases noteworthy contributions from esteemed researchers within the realm of discrete mathematics and mathematical modeling, meticulously subjected to a rigorous peer-review process for publication. The included papers delve into diverse subjects, including controllability, image processing, topology, graph theory, fuzzy delay differential equations, analysis, queuing theory, and applications in networks and biology. Theculmination of these contributions forms a comprehensive and authoritative resource for scholars and professionals alike.
Discrete Mathematics and its Applications (Sixth Edition)
by Kenneth H. RosenThis book gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide variety of real-world applications.
Discrete Mathematics for Computer Scientists
by Clifford Stein Robert L. Drysdale Kenneth BogartDiscrete Mathematics for Computer Scientists provides computer science students the foundation they need in discrete mathematics. It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic.
Discrete Mathematics for Computing (3rd Edition)
by Peter Grossman<p>Palgrave Macmillan Discrete Mathematics for Computing is suitable for students taking a one-semester introductory course in discrete mathematics, particularly those studying Computing and Informations Systems. It presents the essential mathematics needed for computing in a style suitable for students with only a moderate background in the subject. <p>Material is introduced at a gentle pace and in an informal style, without compromising mathematical integrity. The text includes many examples of how the theory is applied to problems in computing. This third edition includes: a new expanded section on encryption, additional examples to illustrate key concepts, new exercises at a variety of levels. <p>Peter Grossman has worked in universities and industry as a mathematician and computing professional. As a lecturer in mathematics, he was responsible for coordinating and developing mathematics courses for computing students. He has applied his skills in areas as diverse as calculator design, irrigation systems and underground mine layouts.
Discrete Mathematics with Applications (4th edition)
by Susanna S. EppThis textbook for computer science and math majors describes processes that consist of a sequence of individual steps, and explains the concepts of logic, proof, induction, recursion, algorithms, and discrete structures. The third edition adds a chapter on finite-state automata, and sections on modular arithmetic and cryptography, expected value, and conditional probability. Annotation ©2004 Book News, Inc., Portland, OR (booknews.com)
Discrete Mathematics with Applications (Mathematics Ser.)
by Susanna S. EppNIMAC-sourced textbook <P><P>Susanna Epp's DISCRETE MATHEMATICS, THIRD 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. <P><P><i>Advisory: Please be advised that the audio format is the only format working at this time. We apologize for any inconvenience and hope to have a fix soon.</i>
Discrete Mathematics with Coding (Textbooks in Mathematics)
by Hugo D JunghennThis book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming. Unlike most discrete mathematics texts focusing on one of the other, the book explores the rich and important connection between these two disciplines and shows how each discipline reinforces and enhances the other. The mathematics in the book is self-contained, requiring only a good background in precalculus and some mathematical maturity. New mathematical topics are introduced as needed. The coding language used is VBA Excel. The language is easy to learn, has intuitive commands, and the reader can develop interesting programs from the outset. Additionally, the spreadsheet platform in Excel makes for convenient and transparent data input and output and provides a powerful venue for complex data manipulation. Manipulating data is greatly simplified using spreadsheet features and visualizing the data can make programming and debugging easier. The VBA language is seamlessly integrated into the spreadsheet environment with no other resources required. Furthermore, as some of the modules in the book show, intricate patterns, graphs, and animation in the form of moving cells is possible. Features Introduces coding in VBA Excel assuming no previous coding experience. Develops programs in Linear Analysis, Logic, Combinatorics, Probability, and Number Theory. Contains over 90 fully tested and debugged programs. The code for these is as well as the exercises is available on the author's website. Contains numerous examples that gradually introduce the reader to coding techniques. Includes programs that solve systems of linear equations, linear programming problems, combinatorial problems, Venn diagram problems and programs that produce truth tables from logic statements and logic statements from switching and gate circuits, encrypt and decrypt messages and simulate probability experiments.
Discrete Mathematics with Ducks (Textbooks in Mathematics)
by Sarah-Marie Belcastro<p>Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challenging. At the same time, it provides stimulating material that instructors can use for more advanced students. The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. <p>The new, expanded edition continues to facilitate effective and active learning. It is designed to help students learn about discrete mathematics through problem-based activities. These are created to inspire students to understand mathematics by actively practicing and doing, which helps students better retain what they’ve learned. As such, each chapter contains a mixture of discovery-based activities, projects, expository text, in-class exercises, and homework problems. The author’s lively and friendly writing style is appealing to both instructors and students alike and encourages readers to learn. The book’s light-hearted approach to the subject is a guiding principle and helps students learn mathematical abstraction.</p>
Discrete Mathematics, Probability Theory and Stochastic Processes: For Applications in Engineering and Computer Science (Modeling and Optimization in Science and Technologies #20)
by Samir Brahim Belhaouari Halima Bensmail Farshid MehrdoustThis book provides a comprehensive overview of discrete mathematics, probability theory, and stochastic processes, covering a wide range of topics in each area. It is designed to be a self-contained resource for students and professionals wishing to improve their understanding of these important mathematical concepts. The book takes a practical approach to the subject matter, providing real-world examples and applications to help readers understand how these mathematical concepts are used in various fields, such as computer science, engineering, and finance.
Discrete Mathematics: A Concise Introduction (Synthesis Lectures on Mathematics & Statistics)
by George TourlakisThis book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. “Safe” – that is, paradox-free – informal set theory is introduced following on the heels of Russell’s Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor’s diagonalisation technique. Predicate logic “for the user” is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.
Discrete Mathematics: An Open Introduction (Discrete Mathematics and Its Applications)
by Oscar LevinDiscrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduction to select topics in discrete mathematics at a level appropriate for first or second year undergraduate math and computer science majors, especially those who intend to teach middle and high school mathematics. The book began as a set of notes for the Discrete Mathematics course at the University of Northern Colorado. This course serves both as a survey of the topics in discrete math and as the “bridge” course for math majors. Features Uses problem-oriented and inquiry-based methods to teach the concepts. Suitable for undergraduates in mathematics and computer science. New to the 4th edition Large scale restructuring. Contains more than 750 exercises and examples. New sections on probability, relations, and discrete structures and their proofs.
Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography
by R. Balakrishnan Sriraman SridharanConveying ideas in a user-friendly style, this book has been designed for a course in Applied Algebra. The book covers graph algorithms, basic algebraic structures, coding theory and cryptography. It will be most suited for senior undergraduates and beginning graduate students in mathematics and computer science as also toindividuals who want to have a knowledge of the below-mentioned topics. Provides a complete discussion on several graph algorithms such as Prims algorithm and Kruskals algorithm for sending a minimum cost spanning tree in a weighted graph, Dijkstras single source shortest path algorithm, Floyds algorithm, Warshalls algorithm, Kuhn-Munkres Algorithm. In addition to DFS and BFS search, several applications of DFS and BFS are also discussed. Presents a good introduction to the basic algebraic structures, namely, matrices, groups, rings, fields including finite fields as also a discussion on vector spaces and linear equations and their solutions. Provides an introduction to linear codes including cyclic codes. Presents a description of private key cryptosystems as also a discussion on public key cryptosystems such as RSA, ElGamal and Miller-Rabin. Finally, the Agrawal-KayalSaxena algorithm (AKS Algorithm) for testing if a givenpositive integer is prime or not in polynomial time is presented- the first time in a textbook. Two distinguished features of the book are: Illustrative examples have been presented throughout the book to make the readers appreciate the concepts described. Answers to all even-numbered exercises in all the chapters are given.
Discrete Mathematics: Proofs, Structures and Applications, Third Edition
by John Taylor Rowan GarnierTaking 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 prog
Discrete Mechanics, Geometric Integration and Lie–Butcher Series: Dmgilbs, Madrid, May 2015 (Springer Proceedings in Mathematics & Statistics #267)
by Kurusch Ebrahimi-Fard María Barbero LiñánThis volume resulted from presentations given at the international “Brainstorming Workshop on New Developments in Discrete Mechanics, Geometric Integration and Lie–Butcher Series”, that took place at the Instituto de Ciencias Matemáticas (ICMAT) in Madrid, Spain. It combines overview and research articles on recent and ongoing developments, as well as new research directions. Why geometric numerical integration? In their article of the same title Arieh Iserles and Reinout Quispel, two renowned experts in numerical analysis of differential equations, provide a compelling answer to this question. After this introductory chapter a collection of high-quality research articles aim at exploring recent and ongoing developments, as well as new research directions in the areas of geometric integration methods for differential equations, nonlinear systems interconnections, and discrete mechanics. One of the highlights is the unfolding of modern algebraic and combinatorial structures common to those topics, which give rise to fruitful interactions between theoretical as well as applied and computational perspectives. The volume is aimed at researchers and graduate students interested in theoretical and computational problems in geometric integration theory, nonlinear control theory, and discrete mechanics.
Discrete Mechanics: Concepts and Applications (Iste Ser.)
by Jean-Paul CaltagironeThe discrete vision of mechanics is based on the founding ideas of Galileo and the principles of relativity and equivalence, which postulate the equality between gravitational mass and inertial mass. To these principles are added the Hodge–Helmholtz decomposition, the principle of accumulation of constraints and the hypothesis of the duality of physical actions. These principles make it possible to establish the equation of motion based on the conservation of acceleration considered as an absolute quantity in a local frame of reference, in the form of a sum of the gradient of the scalar potential and the curl of the vector potential. These potentials, which represent the constraints of compression and rotation, are updated from the discrete operators. Discrete Mechanics: Concepts and Applications shows that this equation of discrete motion is representative of the compressible or incompressible flows of viscous or perfect fluids, the state of stress in an elastic solid or complex fluid and the propagation of nonlinear waves.
Discrete Optimization and Operations Research
by Panos Pardalos Yury Kochetov Michael Khachay Vladimir Beresnev Evgeni NurminskiThis book constitutes the proceedings of the 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016, held in Vladivostok, Russia, in September 2016. The 39 full papers presented in this volume were carefully reviewed and selected from 181 submissions. They were organized in topical sections named: discrete optimization; scheduling problems; facility location; mathematical programming; mathematical economics and games; applications of operational research; and short communications.
Discrete Optimization in Architecture
by Machi ZawidzkiThis book is comprised of two parts, both of which exploremodular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents severalmethods of creating PZ and TZ structures subjected to discrete optimization. The algorithms presented employ graph-theoretic and heuristic methods. Theunderlying idea of both systems is to create free-form structures using theminimal number of types of modular elements. PZ is more conceptual, as it formssingle-branch mathematical knots with a single type of module. Conversely, TZis a skeletal system for creating free-form pedestrian ramps and ramp networksamong any number of terminals in space. In physical space, TZ uses two types ofmodules that are mirror reflections of each other. The optimization criteriadiscussed include: the minimal number of units, maximal adherence to the givenguide paths, etc.
Discrete Optimization in Architecture
by Machi ZawidzkiThis book is comprised of two parts, both of which exploremodular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents severalmethods of creating PZ and TZ structures subjected to discrete optimization. The algorithms presented employ graph-theoretic and heuristic methods. Theunderlying idea of both systems is to create free-form structures using theminimal number of types of modular elements. PZ is more conceptual, as it formssingle-branch mathematical knots with a single type of module. Conversely, TZis a skeletal system for creating free-form pedestrian ramps and ramp networksamong any number of terminals in space. In physical space, TZ uses two types ofmodules that are mirror reflections of each other. The optimization criteriadiscussed include: the minimal number of units, maximal adherence to the givenguide paths, etc.