Discrete mathematics

The Joy of Finite Mathematics: The Language and Art of Math teaches students basic finite mathematics through a foundational understanding of the underlying symbolic language and its many dialects, including logic, set theory, combinatorics (counting), probability, statistics, geometry, algebra, and finance.

This textbook covers topics of undergraduate mathematics in abstract algebra, geometry, topology and analysis with the purpose of connecting the underpinning key ideas.

This two-volume set LNCS 11101 and 11102 constitutes the refereed proceedings of the 15th International Conference on Parallel Problem Solving from Nature, PPSN 2018, held in Coimbra, Portugal, in September 2018.

This two-volume set LNCS 11101 and 11102 constitutes the refereed proceedings of the 15th International Conference on Parallel Problem Solving from Nature, PPSN 2018, held in Coimbra, Portugal, in September 2018.

The multi-volume set LNAI 12975 until 12979 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2021, which was held during September 13-17, 2021.

This proceedings volume presents selected, peer-reviewed contributions from the 26th National School on Algebra, which was held in Constanta, Romania, on August 26-September 1, 2018.

This proceedings volume presents a diverse collection of high-quality, state-of-the-art research and survey articles written by top experts in low-dimensional topology and its applications.

An inviting collection of fun, hands-on applications in mathematics and computingThis book provides a fun, hands-on approach to learning how mathematics and computing relate to the world around us and help us to better understand it.

Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges.

Locally Finite Groups

In this revolutionary work, the author sets the stage for the science ofthe 21st Century, pursuing an unprecedented synthesis of fields previouslyconsidered unrelated.

The aim of this book is to introduce a range of combinatorial methods for those who want to apply these methods in the solution of practical and theoretical problems.

As an introduction to discrete mathematics, this text provides a straightforward overview of the range of mathematical techniques available to students.

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications.

Ruskeepaa gives a general introduction to the most recent versions of Mathematica, the symbolic computation software from Wolfram.

The theme of this book is the self-generation of information by the self-modification of systems.

Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science.

Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures.

Most topics in near-ring and near-field theory are treated here, along with an extensive introduction to the theory.

A collection of papers surveying recent progress in the field of Combinatorial Optimization.

Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology.

This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case.

The range of random graph topics covered in this volume includes structure, colouring, algorithms, mappings, trees, network flows, and percolation.

This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs.

The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs.

Combinatorial problems have been from the very beginning part of the history of mathematics.

This volume contains nine selected papers presented at the Borgholm conference.

Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations

For the first time, this book unites different algebraic approaches for discrete optimization and operations research.

The purpose of this book is to present selected results on perfect graphs in a single volume.

Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.

This work inaugurates a new and general solution method for arbitrary continuous nonlinear PDEs.

Group Representations Volume 1 Part B

Combinatorics '81

The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.

Bonn Workshop on Combinatorial Optimization

Algebraic and Geometric Combinatorics

Combinatorial and Geometric Structures and Their Applications

The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject.

Studies on Graphs and Discrete Programming

Graph Theory (as a recognized discipline) is a relative newcomer to Mathematics.

The Steiner problem asks for a shortest network which spans a given set of points.

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.