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.
A compilation of papers presented at the 1999 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '99 includes surveys and research articles from some of the world's preeminent logicians.
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.
Logicism, as put forward by Bertrand Russell, was predicated on a belief that all of mathematics can be deduced from a very small number of fundamental logical principles.
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.
Bridging the gap between procedural mathematics that emphasizes calculations and conceptual mathematics that focuses on ideas, Mathematics: A Minimal Introduction presents an undergraduate-level introduction to pure mathematics and basic concepts of logic.
Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering.
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.
An exploration of the construction and analysis of translation planes to spreads, partial spreads, co-ordinate structures, automorphisms, autotopisms, and collineation groups.
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.
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.
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.
Reverse Mathematics is a program of research in the foundations of mathematics, motivated by the foundational questions of what are appropriate axioms for mathematics, and what are the logical strengths of particular axioms and particular theorems.
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.
