This award-winning textbook targets the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.
The articles collected in this volume represent the contributions presented at the IMA workshop on "e;Dynamics of Algorithms"e; which took place in November 1997.
Discrete 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.
Over the past fifty years, the development of chaotic dynamical systems theory and its subsequent wide applicability in science and technology has been an extremely important achievement of modern mathematics.
Sequential Dynamical Systems (SDS) are a class of discrete dynamical systems which significantly generalize many aspects of systems such as cellular automata, and provide a framework for studying dynamical processes over graphs.
As an introduction to discrete mathematics, this text provides a straightforward overview of the range of mathematical techniques available to students.
Building on the author's previous book in the series, Complex Analysis with Applications to Flows and Fields (CRC Press, 2010), Transcendental Representations with Applications to Solids and Fluids focuses on four infinite representations: series expansions, series of fractions for meromorphic functions, infinite products for functions with infinit
Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics.
This book is a tribute to Paul Erd\H{o}s, the wandering mathematician once described as the "e;prince of problem solvers and the absolute monarch of problem posers.
Convexity of sets in linear spaces, and concavity and convexity of functions, lie at the root of beautiful theoretical results that are at the same time extremely useful in the analysis and solution of optimization problems, including problems of either single objective or multiple objectives.
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors.
Modern societies are awash with data that needs to be manipulated in many different ways: encrypted, compressed, shared between users in a prescribed manner, protected from unauthorised access, and transmitted over unreliable channels.
Generalized Trigonometric and Hyperbolic Functions highlights, to those in the area of generalized trigonometric functions, an alternative path to the creation and analysis of these classes of functions.
This book constitutes the proceedings of the 16th International Workshop on Algorithms and Models for the Web Graph, WAW 2019, held in Brisbane, QLD, Australia, in July 2019.
This book constitutes the refereed proceedings of the 15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019, held in Kitakyushu, Japan, in April 2019.
A substantial portion of this book is a revised version of Discrete Event Systems: Modeling and Performance Analysis (1993), which was written by the first author and received the 1999 Harold Chestnut Prize, awarded by the International Federation of Automatic Control (IFAC) for best control engineering textbook.
The proceedings set LNCS 11727, 11728, 11729, 11730, and 11731 constitute the proceedings of the 28th International Conference on Artificial Neural Networks, ICANN 2019, held in Munich, Germany, in September 2019.
This book is a concise, self-contained treatment of the finite element method and all the computational techniques needed for its efficient use and practical implementation.
Applied Finite Mathematics presents the fundamentals of finite mathematics in a style tailored for beginners, but at the same time covers the subject matter in sufficient depth so that the student can see a rich variety of realistic and relevant applications.
The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing.