Discrete mathematics

This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view.

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity.

Eulerian Graphs and Related Topics

The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz.

The contributions in this volume are divided into three sections: theoretical, new models and algorithmic.

The importance of submodular functions has been widely recognized in recent years in combinatorial optimization.

Eulerian Graphs and Related Topics

Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.

Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject.

Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem.

This volume is a tribute to the life and mathematical work of G.

This monograph is based on a series of lectures given by the author at the first Advanced Research Institute on Discrete Applied Mathematics, held at Rutgers University.

Graph Colouring and Variations

Graph Theory and Applications

Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.

This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance.

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems.

Linear and Combinatorial Optimization in Ordered Algebraic Structures

Combinatorics 79.

Combinatorics 79.

Topics on Steiner Systems

Combinatorial Mathematics, Optimal Designs, and Their Applications

Discrete Optimization I

Advances in Graph Theory

Algorithmic Aspects of Combinatorics

Studies in Integer Programming

This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics.

This textbook offers a geometric perspective on special relativity, bridging Euclidean space, hyperbolic space, and Einstein's spacetime in one accessible, self-contained volume.

The expanded and updated 2nd edition of this classic text offers the reader a comprehensive introduction to the concepts of logic functions and equations and their applications across computer science.

This is the first comprehensive monograph to thoroughly investigate constant width bodies, which is a classic area of interest within convex geometry.

Fundamentals of Abstract Algebra is a primary textbook for a one year first course in Abstract Algebra, but it has much more to offer besides this.

The Nuts and Bolts of Proof instructs students on the basic logic of mathematical proofs, showing how and why proofs of mathematical statements work.

Over the past fifty years, the development of chaotic dynamical systems theory and its subsequent wide applicability in science and technology has been an extremely important achievement of modern mathematics.

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

Recursive Model Theory

This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects.

Handbook of Algebra

This undergraduate textbook provides a comprehensive treatment of Euclidean and transformational geometries, supplemented by substantial discussions of topics from various non-Euclidean and less commonly taught geometries, making it ideal for both mathematics majors and pre-service teachers.

This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations.

ACMES (Algorithms and Complexity in Mathematics, Epistemology, and Science) is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science.

This book is intended to introduce researchers and graduate students to the concepts of causal symmetric spaces.

This title is the result of a one-week workshop sponsored by the Swedish research agency, FRN, on the interface between complexity and art.

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic.

Linear models, normally presented in a highly theoretical and mathematical style, are brought down to earth in this comprehensive textbook.

Constraint-based linguistics is intersected by three fields: logic, linguistics, and computer sciences.

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata.

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling.

This book explores the dynamic interplay between fractals and graph theory, two powerful mathematical tools with vast applications.

Mathematics of Tabletop Games provides a bridge between mathematics and hobby tabletop gaming.

In this book we generate graphic images using the software Mathematica thus providing a gentle and enjoyable introduction to this rather technical software and its graphic capabilities.