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
Interest in finite automata theory continues to grow, not only because of its applications in computer science, but also because of more recent applications in mathematics, particularly group theory and symbolic dynamics.
Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design.
Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems.
Hilbert functions and resolutions are both central objects in commutative algebra and fruitful tools in the fields of algebraic geometry, combinatorics, commutative algebra, and computational algebra.
The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words.
Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas.
Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of algebraic combinatorics.
Commutation Relations, Normal Ordering, and Stirling Numbers provides an introduction to the combinatorial aspects of normal ordering in the Weyl algebra and some of its close relatives.
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).
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.
An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject.
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively.
Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory.
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.
Monomial Algebras, Second Edition presents algebraic, combinatorial, and computational methods for studying monomial algebras and their ideals, including Stanley-Reisner rings, monomial subrings, Ehrhart rings, and blowup algebras.
Although much literature exists on the subject of RSA and public-key cryptography, until now there has been no single source that reveals recent developments in the area at an accessible level.
A Beginner's Guide to Mathematical Proof prepares mathematics majors for the transition to abstract mathematics, as well as introducing a wider readership of quantitative science students, such as engineers, to the mathematical structures underlying more applied topics.
Understanding the causes and effects of explosions is important to experts in a broad range of disciplines, including the military, industrial and environmental research, aeronautic engineering, and applied mathematics.
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction.
Helping current and future system designers take a more productive approach in the field, Communication System Security shows how to apply security principles to state-of-the-art communication systems.
Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic
A Beginner's Guide to Mathematical Proof prepares mathematics majors for the transition to abstract mathematics, as well as introducing a wider readership of quantitative science students, such as engineers, to the mathematical structures underlying more applied topics.
Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems.
The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature.
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.
Methods Used to Solve Discrete Math ProblemsInteresting examples highlight the interdisciplinary nature of this areaPearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures.
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products.
From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems.
