A variety of modern research in analysis and discrete mathematics is provided in this book along with applications in cryptographic methods and information security, in order to explore new techniques, methods, and problems for further investigation. Distinguished researchers and scientists in analysis and discrete mathematics present their research. Graduate students, scientists and engineers, interested in a broad spectrum of current theories, methods, and applications in interdisciplinary fields will find this book invaluable.

A Student's Guide to the Study, Practice, and Tools of Modern Mathematics provides an accessible introduction to the world of mathematics. It offers tips on how to study and write mathematics as well as how to use various mathematical tools, from LaTeX and Beamer to Mathematica and Maple to MATLAB and R. Along with a color insert, the text include

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)

Reflecting many of the recent advances and trends in this area, this classroom-tested text covers the core topics in discrete structures as outlined by the ACM and explores an assortment of novel applications, including simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. It p

Written by experts in both mathematics and biology, Algebraic and Discrete Mathematical Methods for Modern Biology offers a bridge between math and biology, providing a framework for simulating, analyzing, predicting, and modulating the behavior of complex biological systems. Each chapter begins with a question from modern biology, followed by the description of certain mathematical methods and theory appropriate in the search of answers. Every topic provides a fast-track pathway through the problem by presenting the biological foundation, covering the relevant mathematical theory, and highlighting connections between them. Many of the projects and exercises embedded in each chapter utilize specialized software, providing students with much-needed familiarity and experience with computing applications, critical components of the "modern biology" skill set. This book is appropriate for mathematics courses such as finite mathematics, discrete structures, linear algebra, abstract/modern algebra, graph theory, probability, bioinformatics, statistics, biostatistics, and modeling, as well as for biology courses such as genetics, cell and molecular biology, biochemistry, ecology, and evolution. - Examines significant questions in modern biology and their mathematical treatments - Presents important mathematical concepts and tools in the context of essential biology - Features material of interest to students in both mathematics and biology - Presents chapters in modular format so coverage need not follow the Table of Contents - Introduces projects appropriate for undergraduate research - Utilizes freely accessible software for visualization, simulation, and analysis in modern biology - Requires no calculus as a prerequisite - Provides a complete Solutions Manual - Features a companion website with supplementary resources

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together research in the field, encompassing work on percolation, isoperimetric inequalities, eigenvalues, transition probabilities, and random walks. Written by two leading researchers, the text emphasizes intuition, while giving complete proofs and more than 850 exercises. Many recent developments, in which the authors have played a leading role, are discussed, including percolation on trees and Cayley graphs, uniform spanning forests, the mass-transport technique, and connections on random walks on graphs to embedding in Hilbert space. This state-of-the-art account of probability on networks will be indispensable for graduate students and researchers alike.

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.