Discrete mathematics

Tracing its roots back to World War II, operations research (OR) has become a vital tool in military and defense strategy.

Numerical Algorithmic Science and Engineering (NAS&E), or more compactly, Numerical Algorithmics, is the theoretical and empirical study and the practical implementation and application of algorithms for solving finite-dimensional problems of a numeric nature.

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and ApplicationsThe Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing.

This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics.

This textbook introduces discrete mathematics by emphasizing the importance of reading and writing proofs.

Science involves descriptions of the world we live in.

Theories, methods and problems in approximation theory and analytic inequalities with a focus on differential and integral inequalities are analyzed in this book.

With the advent of data-intensive applications, the elimination of redundancy in disseminated information has become a serious challenge for researchers who are on the lookout for evolving metaheuristic algorithms which can explore and exploit the information feature space to derive the optimal settings for specific applications.

The aim of this book is to make the subject easier to understand.

Student Handbook for Discrete Mathematics with Ducks is a Student Reference, Review, Supplemental Learning, and Example Handbook (SRRSLEH) that mirrors the content of the author's popular textbook Discrete Mathematics with Ducks (DMwD).

This book covers applications of fractional calculus used for medical and health science.

This book explores the inequalities for eigenvalues of the six matrices associated with graphs.

This book constitutes the refereed proceedings of the 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, held in Limassol, Cyprus, in January 2020.

This book constitutes the refereed proceedings of the 12th International Conference on Graph Transformation, ICGT 2019, held as part of STAF 2019, in Eindhoven, The Netherlands, in July2019.

Computer and Information Security Handbook, Fourth Edition offers deep coverage of an extremely wide range of issues in computer and cybersecurity theory, along with applications and best practices, offering the latest insights into established and emerging technologies and advancements.

Through three editions, Cryptography: Theory and Practice, has been embraced by instructors and students alike.

Foreword by Dieter Jungnickel Finite Commutative Rings and their Applications answers a need for an introductory reference in finite commutative ring theory as applied to information and communication theory.

Asymptotic Combinatorial Coding Theory is devoted to the investigation of the combinatorial properties of transmission systems using discrete signals.

Eschewing the often standard dry and static writing style of traditional textbooks, Discrete Encounters provides a refreshing approach to discrete mathematics.

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations.

An Elementary Transition to Abstract Mathematics will help students move from introductory courses to those where rigor and proof play a much greater role.

More than 250 exercises and solutions on properties and applications of Catalan numbers, at levels ranging from recreational to research.

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications.

Cryptology: Classical and Modern, Second Edition proficiently introduces readers to the fascinating field of cryptology.

Introduction to Mathematical Proofs helps students develop the necessary skills to write clear, correct, and concise proofs.

Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.

Concentration inequalities for functions of independent random variables is an area of probability theory that has witnessed a great revolution in the last few decades, and has applications in a wide variety of areas such as machine learning, statistics, discrete mathematics, and high-dimensional geometry.

This book explores mathematics in a wide variety of applications, ranging from problems in electronics, energy and the environment, to mechanics and mechatronics.

A Transition to Proof: An Introduction to Advanced Mathematics describes writing proofs as a creative process.

No detailed description available for "e;Applied Multivariate Statistical Analysis and Related Topics with R"e;.

Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises.

This book presents a printed testimony for the fact that George Andrews, one of the world's leading experts in partitions and q-series for the last several decades, has passed the milestone age of 80.

This IMA Volume in Mathematics and its Applications TOPOLOGY AND GEOMETRY IN POLYMER SCIENCE is based on the proceedings of a very successful one-week workshop with the same title.

The major purpose of this book is to introduce the main concepts of discrete optimization problems which have a finite number of feasible solutions.

Compressible Flow with Application to Shocks and Propulsion is part of the series "e;Mathematics and Physics for Science and Technology"e;, which combines rigorous mathematics with general physical principles to model practical engineering systems with a detailed derivation and interpretation of results.

The range of random graph topics covered in this volume includes structure, colouring, algorithms, mappings, trees, network flows, and percolation.

Unlike most elementary books on matrices, A Combinatorial Approach to Matrix Theory and Its Applications employs combinatorial and graph-theoretical tools to develop basic theorems of matrix theory, shedding new light on the subject by exploring the connections of these tools to matrices.

In the spectrum of mathematics, graph theory which studies a mathe- matical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer.

Marking 94 years since its first appearance, this book provides an annotated translation of Sainte-Lague's seminal monograph Les reseaux (ou graphes), drawing attention to its fundamental principles and ideas.

This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb's insights and illustrative examples.

Originally published in 1984.

At first sight discrete and fractional programming techniques appear to be two com- pletely unrelated fields in operations research.

The fourth edition of this widely used textbook offers a new perspective.

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.