Kategoria BISAC: Mathematics >> Discrete Mathematics

For the first two editions of the book Probability (GTM 95), each chapter included a comprehensive and diverse set of relevant exercises. While the work on the third edition was still in progress, it was decided that it would be more appropriate to publish a separate book that would comprise all of the exercises from previous editions, in addition to many new exercises.

Most of the material in this book consists of exercises created by Shiryaev, collected and compiled over the course of many years while working on many interesting topics. Many of the exercises resulted from...

Formal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required to behave reliably. To be acceptable in an industrial setting, formal verification must be highly algorithmic; to cope with design complexity, it must support a top-down design methodology that leads from an abstract design to its detailed implementation. That combination of requirements points directly to the widely recognized solution of automata-theoretic verification, on account of its expressiveness, computational...

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,...

Combinatorics and Reasoning: Representing, Justifying and Building Isomorphisms is based on the accomplishments of a cohort group of learners from first grade through high school and beyond, concentrating on their work on a set of combinatorics tasks. By studying these students, the editors gain insight into the foundations of proof building, the tools and environments necessary to make connections, activities to extend and generalize combinatoric learning, and even explore implications of this learning on the undergraduate level.

This volume underscores the power of...

The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn.

These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide...

Digital Functions and Data Reconstruction: Digital-Discrete Methods provides a solid foundation to the theory of digital functions and its applications to image data analysis, digital object deformation, and data reconstruction. This new method has a unique feature in that it is mainly built on discrete mathematics with connections to classical methods in mathematics and computer sciences.

Digitally continuous functions and gradually varied functions were developed in the late 1980s. A. Rosenfeld (1986) proposed digitally continuous functions for digital image analysis,...

This book provides a systematic, rigorous and self-contained treatment of positive dynamical systems. A dynamical system is positive when all relevant variables of a system are nonnegative in a natural way. This is in biology, demography or economics, where the levels of populations or prices of goods are positive. The principle also finds application in electrical engineering, physics and computer sciences.

"The author has greatly expanded the field of positive systems in surprising ways." - Prof. Dr. David G. Luenberger, Stanford University(USA)

Formal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required to behave reliably. To be acceptable in an industrial setting, formal verification must be highly algorithmic; to cope with design complexity, it must support a top-down design methodology that leads from an abstract design to its detailed implementation. That combination of requirements points directly to the widely recognized solution of automata-theoretic verification, on account of its expressiveness, computational...

A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing vertex colorings induced by edge colorings. The coloring concepts described in this book depend not only on the property required of the initial edge coloring and the kind of objects serving as colors, but also on the property demanded of the vertex coloring produced. For each edge coloring introduced, background for the concept is provided, followed by a presentation of results and open questions dealing with this topic. While the edge colorings discussed can be either proper or unrestricted,...

Stochastic geometry is the branch of mathematics that studies geometric structures associated with random configurations, such as random graphs, tilings and mosaics. Due to its close ties with stereology and spatial statistics, the results in this area are relevant for a large number of important applications, e.g. to the mathematical modeling and statistical analysis of telecommunication networks, geostatistics and image analysis. In recent years due mainly to the impetus of the authors and their collaborators a powerful connection has been established between stochastic geometry and the...