Discrete mathematics

The subject of this book is truly original.

Methods Used to Solve Discrete Math ProblemsInteresting examples highlight the interdisciplinary nature of this areaPearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures.

This book constitutes the proceedings of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021, held in Milan, Italy, in March 2021.

Thirty years after RSA was first publicized, it remains an active research area.

The authors have written an introduction to logic taking Godel's incompleteness theorem as a starting point.

"e;Viruses don't harm, ignorance does.

Putnam and Beyond takes the reader on a journey through the world of college mathematics, focusing on some of the most important concepts and results in the theories of polynomials, linear algebra, real analysis in one and several variables, differential equations, coordinate geometry, trigonometry, elementary number theory, combinatorics, and probability.

Combinatorics is one of the fastest growing ?

This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8-10, 2020.

Discrete geometry investigates combinatorial properties of configurations of geometric objects.

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

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.

Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space.

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

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs.

Focused on the mathematical foundations of social media analysis, Graph-Based Social Media Analysis provides a comprehensive introduction to the use of graph analysis in the study of social and digital media.

This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018.

Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics.

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

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values.

Knowledge Discovery and Measures of Interest is a reference book for knowledge discovery researchers, practitioners, and students.

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.

Non-Linear Differential Equations and Dynamical Systems is the second book within Ordinary Differential Equations with Applications to Trajectories and Vibrations, Six-volume Set.

Aspects of Integration: Novel Approaches to the Riemann and Lebesgue Integrals is comprised of two parts.

Is it possible to apply a network model to composites with conical inclusions?

The world is continuous, but the mind is discrete.

Codes, Curves, and Signals: Common Threads in Communications is a collection of seventeen contributions from leading researchers in communications.

What is a number?

The tool for visualization is Microsoft Visual C++.

An engaging introduction to ergodic theory for graduate students, and a useful reference for the professional mathematician.

Modern cryptography has evolved dramatically since the 1970s.

Automated Theorem Proving: A Logical Basis

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.

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math- ematics.

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdos (1913-1996), one of the most versatile and prolific mathematicians of our time.

This is the most readable and thorough graduate textbook and reference for combinatorics, covering enumeration, graphs, sets, and methods.

Intended for first- or second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies constructivist principles that promote - indeed, require - active participation by the student.

This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course.

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

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 contains 28 research articles from among the 49 papers and abstracts presented at the Tenth International Conference on Fibonacci Numbers and Their Applications.

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

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.

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 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.

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.