Discrete mathematics

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups.

As a first comprehensive overview on Farey sequences and subsequences, this monograph is intended as a reference for anyone looking for specific material or formulas related to the subject.

As a first comprehensive overview on Farey sequences and subsequences, this monograph is intended as a reference for anyone looking for specific material or formulas related to the subject.

This two-volume set collects and presents many fundamentals of mathematics in an enjoyable and elaborating fashion.

This two-volume set collects and presents many fundamentals of mathematics in an enjoyable and elaborating fashion.

This book introduces polyhedra as a tool for graph theory and discusses their properties and applications in solving the Gauss crossing problem.

This book introduces polyhedra as a tool for graph theory and discusses their properties and applications in solving the Gauss crossing problem.

The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age.

The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age.

This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence.

This book provides a systematic, rigorous and self-contained treatment of positive dynamical systems.

Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs.

After being an open question for sixty years the Tarski conjecture was answered in the affirmative by Olga Kharlampovich and Alexei Myasnikov and independently by Zlil Sela.

There is no recent elementary introduction to the theory of discrete dynamical systems that stresses the topological background of the topic.

This book provides a systematic, rigorous and self-contained treatment of positive dynamical systems.

Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs.

There is no recent elementary introduction to the theory of discrete dynamical systems that stresses the topological background of the topic.

After being an open question for sixty years the Tarski conjecture was answered in the affirmative by Olga Kharlampovich and Alexei Myasnikov and independently by Zlil Sela.

Differential equations with impulses arise as models of many evolving processes that are subject to abrupt changes, such as shocks, harvesting, and natural disasters.

Paul Turan, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910.

This volume contains selected refereed papers based on lectures presented at the "e;Integers Conference 2011"e;, an international conference in combinatorial number theory that was held in Carrollton, Georgia, United States in October 2011.

This book focuses on the dynamic complexity of neural, genetic networks, and reaction diffusion systems.

Embeddings of discrete metric spaces into Banach spaces recently became an important tool in computer science and topology.

Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools.

This textbook is devoted to Combinatorics and Graph Theory, which are cornerstones of Discrete Mathematics.

This book is divided into two parts, the first of which seeks to connect the phase transitions of various disciplines, including game theory, and to explore the synergies between statistical physics and combinatorics.

This book constitutes the proceedings of the first International Symposium on Cyber Security Cryptography and Machine Learning, held in Beer-Sheva, Israel, in June 2017.

This volume contains nine refereed research papers in various areas from combinatorics to dynamical systems, with computer algebra as an underlying and unifying theme.

Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory.

Automatic sequences are sequences which are produced by a finite automaton.

This volume contains the proceedings of the vVorkshop on Trees held in Versailles on 14-16 June 1995.

To mark the World Mathematical Year 2000 an International Conference on Number Theory and Discrete Mathematics in honour of the legendary Indian Mathematician Srinivasa Ramanuj~ was held at the centre for Advanced study in Mathematics, Panjab University, Chandigarh, India during October 2-6, 2000.

This book contains the proceedings of the conference "e;Fractals in Graz 2001 - Analysis, Dynamics, Geometry, Stochastics"e; that was held in the second week of June 2001 at Graz University of Technology, in the capital of Styria, southeastern province of Austria.

A ring R satisfies a polynomial identity if there is a polynomial f in noncommuting variables which vanishes under substitutions from R.

A set in complex Euclidean space is called C-convex if all its intersections with complex lines are contractible, and it is said to be linearly convex if its complement is a union of complex hyperplanes.

It has long been recognized that there are fascinating connections between cod- ing theory, cryptology, and combinatorics.

This book focuses on a large class of geometric objects in moduli theory and provides explicit computations to investigate their families.

What is order that is not based on simple repetition, that is, periodicity?

In the last years there has been significant progress in the theory of valuations, which in turn has led to important achievements in integral geometry.

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 text is based on a lecture course given by the authors in the framework of Oberwolfach Seminars at the Mathematisches Forschungsinstitut Oberwolfach in May, 2013.

Every year there is at least one combinatorics problem in each of the major international mathematical olympiads.

Tamari lattices originated from weakenings or reinterpretations of the familar associativity law.

This is the first comprehensive monograph on the mathematical theory of the solitaire game "e;The Tower of Hanoi"e; which was invented in the 19th century by the French number theorist Edouard Lucas.