subcategories
Combinatorics (18)
Graph Theory (20)
e-books in Discrete Mathematics category
by Oscar Levin - University of Northern Colorado , 2017
This book was written to be used as the primary text for introduction to proof, as well as an introduction to topics in discrete mathematics. Contents: Counting; Sequences; Symbolic Logic and Proofs; Graph Theory; Generating Functions; and more.
(4756 views)
by Alexander I. Bobenko (ed.) - Springer , 2016
This is the book on a newly emerging field of discrete differential geometry. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics.
(3885 views)
by Edward A. Bender, S. Gill Williamson - University of California, San Diego , 2010
In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.
(3361 views)
by Harris Kwong - Open SUNY Textbooks , 2015
This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.
(3509 views)
by Ken Bogart, Cliff Stein - Dartmouth College , 2003
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
(5327 views)
by Al Doerr, Ken Levasseur - Lulu.com , 2013
Applied Discrete Structures is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.
(4861 views)
by Kenneth H. Rosen - Mcgraw-Hill College , 1996
This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. It is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.
(4884 views)
by Jean Gallier - arXiv , 2008
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.
(11071 views)
by Vladlen Koltun - Stanford University , 2008
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.
(8484 views)
by M. O. Albertson, J. P. Hutchinson - J. Wiley , 1988
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...
(5862 views)
by Kenneth R. Koehler - University of Cincinnati Blue Ash College , 2002
This book is an introduction to the mathematics used in the design of computer and network hardware and software. We will survey topics in computer arithmetic and data representation, logic and set theory, graph theory and computer measurement.
(7435 views)
by A.F. Pixley - Harvey Mudd College , 2010
This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.
(6803 views)
- Wikibooks , 2012
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
(10726 views)
by Rupinder Sekhon - Connexions , 2011
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
(9236 views)
by Petter Holme, Jari SaramÃ¤ki - arXiv , 2011
In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.
(8349 views)
by Eric Lehman, F Thomson Leighton, Albert R Meyer - MIT , 2010
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
(12820 views)
by Marcel B. Finan - Arkansas Tech University , 2001
This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.
(12686 views)
by M. Desbrun, P. Schroeder, M. Wardetzky - Columbia University , 2008
This new and elegant area of mathematics has exciting applications, as this text demonstrates by presenting practical examples in geometry processing (surface fairing, parameterization, and remeshing) and simulation (of cloth, shells, rods, fluids).
(11125 views)
by J. G. Kemeny, J. L. Snell, G. L. Thompson - Prentice-Hall , 1974
This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.
(11526 views)
by C. D. H. Cooper - Macquarie University , 2008
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.
(16159 views)
by W W L Chen - Macquarie University , 2008
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.
(23997 views)
by Edward A. Bender, S. Gill Williamson - Dover Publications , 2005
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(26518 views)
by Miguel A. Lerma , 2005
Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.
(16100 views)
by Herbert S. Wilf - A K Peters, Ltd. , 2006
The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.
(16829 views)