D.O - Combinatorics 1

Military service involves exposure to multiple sources of chronic, acute, and potentially traumatic stress, especially during deployment and combat. Notoriously variable, the effects of stress can b……続きを見る

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 impo……続きを見る

Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is intended as a general introduction to g……続きを見る

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main……続きを見る

Modern Computational Methods for Fractional Differential Equations provides a comprehensive introduction to the fundamentals of fractional calculus. Covering a range of analytical and numerical meth……続きを見る

100 exercices résolus : inéquations du premier degré – Par la pratique, pas par la théorie ! Ce livre s'adresse aux élèves qui souhaitent améliorer leurs compétences en résolution d'inéquations à un……続きを見る

This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in th……続きを見る

This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully wr……続きを見る

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 syste……続きを見る

Unlike data communications of the past, today’s networks consist of numerous devices that handle the data as it passes from the sender to the receiver. However, security concerns are frequently rais……続きを見る

Discrete Event Simulation is a process-oriented text/reference that utilizes an eleven-step model to represent the simulation process from problem formulation to implementation and documentation. Th……続きを見る

Graphs & Digraphs, Seventh Edition masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, the……続きを見る

Praise for the First Edition "Luck, Logic, and White Lies teaches readers of all backgrounds about the insight mathematical knowledge can bring and is highly recommended reading among avid game play……続きを見る

Aquí se exponen las Reglas Generales de la combinatoria, los Principios Aditivo y Multiplicativo, las variaciones, permutaciones y combinaciones con y sin repetición. se definen estos conceptos y se……続きを見る

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structur……続きを見る

This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which……続きを見る

Matroid theory is a vibrant area of research that provides a unified way to understand graph theory, linear algebra and combinatorics via finite geometry. This book provides the first comprehensive ……続きを見る

Bridges combinatorics and probability and uniquely includes detailed formulas and proofs to promote mathematical thinking Combinatorics: An Introduction introduces readers to counting combinatorics,……続きを見る

This book is an expansion of our first book Introduction to Graph Theory: H3 Mathematics. While the first book was intended for capable high school students and university freshmen, this version cov……続きを見る

Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathem……続きを見る

A word is said to be primitive if it cannot be represented as any power of another word. It is a well-known conjecture that the set of all primitive words Q over a non-trivial alphabet is not contex……続きを見る