Discrete mathematics

This book constitutes the thoroughly refereed post-workshop proceedings of the 6th International Workshop on the Arithmetic of Finite Field, WAIFI 2016, held in Ghent, Belgium, in July 2016.

This textbook provides mathematical tools and applies them to study key aspects of data transmission such as encryption and compression.

Sturm-Liouville problems arise naturally in solving technical problems in engineering, physics, and more recently in biology and the social sciences.

This book constitutes the revised selected papers from the 23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024, held in Omsk, Russia from June 30 to July 06, 2024.

Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians.

The study of polynomial completeness of algebraic systems has only recently matured, and until now, lacked a unified treatment.

This book constitutes revised selected papers from the 8th International Workshop on Constructive Side-Channel Analysis and Secure Design, COSADE 2017, held in Paris, France, in April 2017.

This book constitutes the proceedings of the 15th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2018, held in Delft, The Netherlands, in June 2018.

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.

This book contains 28 research articles from among the 49 papers and abstracts presented at the Tenth International Conference on Fibonacci Numbers and Their Applications.

In the late 1960s British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell.

The book reviews inequalities for weighted entry sums of matrix powers.

This book constitutes the refereed proceedings of the 15th Conference on Computability in Europe, CiE 2019, held in Durham, UK, in July 2019.

This book presents innovative breakthroughs in operational excellence that can solve the operational issues of smart factories.

The conference proceeding  LNCS 11346 constitutes the refereed proceedings of the 12th International Conference on Combinatorial Optimization and Applications, COCOA 2018, held in Atlanta, GA, USA, in December 2018.

Although there are some books dealing with algebraic theory of automata, their contents consist mainly of Krohn-Rhodes theory and related topics.

Boundary value problems play a significant role in modeling systems characterized by established conditions at their boundaries.

The mathematical theory of computation has given rise to two important ap- proaches to the informal notion of "e;complexity"e;: Kolmogorov complexity, usu- ally a complexity measure for a single object such as a string, a sequence etc.

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("e;generators"e;).

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms.

This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022.

This book presents the state-of-the-art in the emerging field of data science and includes models for layered security with applications in the protection of sites-such as large gathering places-through high-stake decision-making tasks.

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

This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiri Matousek, who passed away prematurely in March 2015.

This book aims to provide an introduction to the broad and dynamic subject of discrete energy problems and point configurations.

Beyond calculus, the world of mathematics grows increasingly abstract and places new and challenging demands on those venturing into that realm.

The theory of Petri nets is a part of computer science whose importance is increasingly acknowledged.

Mathematical Logic and Theoretical Computer Science covers various topics ranging from recursion theory to Zariski topoi.

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

The three-volume proceedings LNCS 10210-10212 constitute the thoroughly refereed proceedings of the 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017, held in Paris, France, in April/May 2017.

Originally published in 1984.

Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata.

This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems.

This award-winning textbook targets the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.

Mathematical systems theory is a vibrant research area in its own right.

This collection honours Ron Doney's work and includes invited articles by his collaborators and friends.

The articles collected in this volume represent the contributions presented at the IMA workshop on "e;Dynamics of Algorithms"e; which took place in November 1997.

Decomposable sets since T.

Contemporary students of mathematics differ considerably from those of half a century ago.

Computability theory originated with the seminal work of Godel, Church, Turing, Kleene and Post in the 1930s.

This classic introduction to the main areas of mathematical logic provides the basis for a first graduate course in the subject.

Covering topics in graph theory, L-functions, p-adic geometry, Galois representations, elliptic fibrations, genus 3 curves and bad reduction, harmonic analysis, symplectic groups and mould combinatorics, this volume presents a collection of papers covering a wide swath of number theory emerging from the third iteration of the international Women in Numbers conference, "e;Women in Numbers - Europe"e; (WINE), held on October 14-18, 2013 at the CIRM-Luminy mathematical conference center in France.

Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope.

Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are developed here and carefully implemented in the computer algebra system Maple(TM).

Numerous well-presented and important papers from the conference are gathered in the proceedings for the purpose of pointing directions for useful future research in diverse areas of mathematics including algebraic geometry, analysis, commutative algebra, complex analysis, discrete mathematics, dynamical systems, number theory and topology.

This book constitutes the proceedings of the 15th International Conference on Business Process Management, BPM 2017, held in Barcelona, Spain, in September 2017.

An introduction to enumerative combinatorics, vital to many areas of mathematics.

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.