Discrete mathematics

The name "e;random walk"e; for a problem of a displacement of a point in a sequence of independent random steps was coined by Karl Pearson in 1905 in a question posed to readers of "e;Nature"e;.

The study of network theory is a highly interdisciplinary field, which has emerged as a major topic of interest in various disciplines ranging from physics and mathematics, to biology and sociology.

This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information networks (HINs).

Numerical Algorithmic Science and Engineering (NAS&E), or more compactly, Numerical Algorithmics, is the theoretical and empirical study and the practical implementation and application of algorithms for solving finite-dimensional problems of a numeric nature.

Generating function (GF) is a mathematical technique to concisely represent a known ordered sequence into a simple continuous algebraic function in dummy variable(s).

Discrete Mathematics: Essentials and Applications offers a comprehensive survey of the area, particularly concentrating on the basic principles and applications of Discrete Mathematics.

This monograph introduces a novel and effective approach to counting lattice paths by using the discrete Fourier transform (DFT) as a type of periodic generating function.

This book constitutes the proceedings of the 8th International Conference on Algorithms for Computational Biology, AlCoB 2020, was planned to be held in Missoula, MT, USA in June 2021.

This text presents six mini-courses, all devoted to interactions between representation theory of algebras, homological algebra, and the new ever-expanding theory of cluster algebras.

Differential Equations with Mathematica, Fourth Edition is a supplementing reference which uses the fundamental concepts of the popular platform to solve (analytically, numerically, and/or graphically) differential equations of interest to students, instructors, and scientists.

This book, written by experts from universities and major research laboratories, addresses the hot topic of network coding, a powerful scheme for information transmission in networks that yields near-optimal throughput.

Stability, Control and Application of Time-Delay Systems gives a systematic description of these systems.

This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018.

This easy-to-follow textbook/reference presents a concise introduction to mathematical analysis from an algorithmic point of view, with a particular focus on applications of analysis and aspects of mathematical modelling.

This book consists of contributions from experts, presenting a fruitful interplay between different approaches to discrete geometry.

Differential Equations with Mathematica, Fourth Edition is a supplementing reference which uses the fundamental concepts of the popular platform to solve (analytically, numerically, and/or graphically) differential equations of interest to students, instructors, and scientists.

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.

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

Special functions play a very important role in solving various families of ordinary and partial differential equations as well as their fractional-order analogs, which model real-life situations.

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.

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

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.