Discrete mathematics

A comprehensive account that gives equal attention to the combinatorial, logical and applied aspects of partially ordered sets.

Contains all the techniques, methods and results developed so far in a bid to solve the famous CDC conjecture.

A self-contained introduction to the theory of graph spectra including exercises and an extensive bibliography.

This advanced graduate textbook gives an authoritative and insightful description of the major ideas and techniques of public key cryptography.

This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises.

Develops a full set of homotopical algebra techniques dedicated to the study of higher categories.

Fully updated and revised edition of Csiszár and Körner''s classic book on information theory.

Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference.

A Tour Through Graph Theory introduces graph theory to students who are not mathematics majors.

Essentials of Mathematical Thinking addresses the growing need to better comprehend mathematics today.

Kurt Godel (1906-1978) was an Austrian-American mathematician, who is best known for his incompleteness theorems.

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.

Modern Computational Methods for Fractional Differential Equations provides a comprehensive introduction to the fundamentals of fractional calculus.

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming explains in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems.

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming explains in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems.

The essential guide showing how the unbounded delay model of computation of the Boolean functions may be used in the analysis of the Boolean networks Boolean Functions: Topics in Asynchronicity contains the most current research in several issues of asynchronous Boolean systems.

Features an authentic and engaging approach to mathematical modeling driven by real-world applications With a focus on mathematical models based on real and current data, Models for Life: An Introduction to Discrete Mathematical Modeling with Microsoft Office Excel guides readers in the solution of relevant, practical problems by introducing both mathematical and Excel techniques.

Features an authentic and engaging approach to mathematical modeling driven by real-world applications With a focus on mathematical models based on real and current data, Models for Life: An Introduction to Discrete Mathematical Modeling with Microsoft Office Excel guides readers in the solution of relevant, practical problems by introducing both mathematical and Excel techniques.

A solutions manual to accompany Finite Mathematics: Models and Applications In order to emphasize the main concepts of each chapter, Finite Mathematics: Models and Applications features plentiful pedagogical elements throughout such as special exercises, end notes, hints, select solutions, biographies of key mathematicians, boxed key principles, a glossary of important terms and topics, and an overview of use of technology.

A solutions manual to accompany Finite Mathematics: Models and Applications In order to emphasize the main concepts of each chapter, Finite Mathematics: Models and Applications features plentiful pedagogical elements throughout such as special exercises, end notes, hints, select solutions, biographies of key mathematicians, boxed key principles, a glossary of important terms and topics, and an overview of use of technology.

Solutions manual to accompany Logic and Discrete Mathematics: A Concise Introduction This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade.

Solutions manual to accompany Logic and Discrete Mathematics: A Concise Introduction This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade.

A concise yet rigorous introduction to logic and discrete mathematics.

In the rapidly evolving domain of computational problem-solving, this book delves into the cutting-edge Automatic Generation of Algorithms (AGA) paradigm, a groundbreaking approach poised to redefine algorithm design for optimization problems.

A concise yet rigorous introduction to logic and discrete mathematics.

A clear and lucid bottom-up approach to the basic principles of evolutionary algorithms Evolutionary algorithms (EAs) are a type of artificial intelligence.

This book aims to help engineers, Masters students and young researchers to understand and gain a general knowledge of logistic systems optimization problems and techniques, such as system design, layout, stock management, quality management, lot-sizing or scheduling.

This book aims to help engineers, Masters students and young researchers to understand and gain a general knowledge of logistic systems optimization problems and techniques, such as system design, layout, stock management, quality management, lot-sizing or scheduling.

Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science, explaining the interconnections among the results obtained from important graph theory studies.

Entertaining, surprising and challenging mathematics problems of the sort pondered by generations during afternoon tea.

A thorough yet accessible introduction to the mathematical breakthroughs achieved by using new polynomial methods in the past decade.

A unique approach to mathematical logic where students implement the underlying concepts and proofs in the Python programming language.

A captivating introduction to key results of discrete mathematics through the work of Paul Erdős, blended with first-hand reminiscences.

This is the first book dedicated to reviewing the mathematics of random tilings of large domains on the plane.

This Element reviews fundamental models and methods for the geometric description of real networks.

This Element describes a generalisation of percolation to multilayer networks: weak multiplex percolation.

Develops a new theory, parallel to the classical theory of connected Hopf algebras, including a real hyperplane arrangement.

This Element provides an overview of the ideas, methods and techniques to deal with complex networks datasets.

This Element explores the relations between dynamics and modularity on networks, emphasising the importance of time scale separation and network symmetry.

This Element presents one of the most recent developments in network science in a highly accessible style.

The first comprehensive account of modern geometric theory and its applications, written by a leader in the field.

This book presents fifteen carefully edited expository chapters in the rapidly expanding area of algorithmic graph theory.

This book presents fifteen carefully edited expository chapters in the rapidly expanding area of algorithmic graph theory.

The first full-length book on the theme of symmetry in graphs, a fast-growing topic in algebraic graph theory.

Designed for the intellectually curious, this book provides a solid foundation in basic probability in an informal style, without jargon.

The Mathieu Groups are presented in the context of finite geometry and the theory of group amalgams.

Designed for the intellectually curious, this book provides a solid foundation in basic probability in an informal style, without jargon.

Many of the best researchers and writers in discrete mathematics come together in a volume inspired by Ron Graham.

Provides a comprehensive exploration of the main concepts and techniques from the young, exciting field of approximate groups.

Many of the best researchers and writers in discrete mathematics come together in a volume inspired by Ron Graham.