Graph Searching Games and Probabilistic Methods is the first book that focuses on the intersection of graph searching games and probabilistic methods. The book explores various applications of these powerful mathematical tools to games and processes such as Cops and Robbers, Zombie and Survivors, and Firefighting. Written in an engaging style, the book is accessible to a wide audience including mathematicians and computer scientists. Readers will find that the book provides state-of-the-art results, techniques, and directions in graph searching games, especially from the point of view of probabilistic methods. The authors describe three directions while providing numerous examples, which include: * Playing a deterministic game on a random board. * Players making random moves. * Probabilistic methods used to analyze a deterministic game.

Introduction to Abstract Algebra, Second Edition presents abstract algebra as the main tool underlying discrete mathematics and the digital world. It avoids the usual groups first/rings first dilemma by introducing semigroups and monoids, the multiplicative structures of rings, along with groups. This new edition of a widely adopted textbook covers applications from biology, science, and engineering. It offers numerous updates based on feedback from first edition adopters, as well as improved and simplified proofs of a number of important theorems. Many new exercises have been added, while new study projects examine skewfields, quaternions, and octonions. The first three chapters of the book show how functional composition, cycle notation for permutations, and matrix notation for linear functions provide techniques for practical computation. These three chapters provide a quick introduction to algebra, sufficient to exhibit irrational numbers or to gain a taste of cryptography. Chapters four through seven cover abstract groups and monoids, orthogonal groups, stochastic matrices, Lagrange's theorem, groups of units of monoids, homomorphisms, rings, and integral domains. The first seven chapters provide basic coverage of abstract algebra, suitable for a one-semester or two-quarter course. Each chapter includes exercises of varying levels of difficulty, chapter notes that point out variations in notation and approach, and study projects that cover an array of applications and developments of the theory. The final chapters deal with slightly more advanced topics, suitable for a second-semester or third-quarter course. These chapters delve deeper into the theory of rings, fields, and groups. They discuss modules, including vector spaces and abelian groups, group theory, and quasigroups. This textbook is suitable for use in an undergraduate course on abstract algebra for mathematics, computer science, and education majors, along with students from other STEM fields.

From the reviews: ..". The book under review consists of two monographs on geometric aspects of group theory ... Together, these two articles form a wide-ranging survey of combinatorial group theory, with emphasis very much on the geometric roots of the subject. This will be a useful reference work for the expert, as well as providing an overview of the subject for the outsider or novice. Many different topics are described and explored, with the main results presented but not proved. This allows the interested reader to get the flavour of these topics without becoming bogged down in detail. Both articles give comprehensive bibliographies, so that it is possible to use this book as the starting point for a more detailed study of a particular topic of interest. ..." Bulletin of the London Mathematical Society, 1996

This book is an expansion of our first book Introduction to Graph Theory: H3 Mathematics. While the first book was intended for capable high school students and university freshmen, this version covers substantially more ground and is intended as a reference and textbook for undergraduate studies in Graph Theory. In fact, the topics cover a few modules in the Graph Theory taught at the National University of Singapore. The reader will be challenged and inspired by the material in the book, especially the variety and quality of the problems, which are derived from the authors' years of teaching and research experience.

This book is an expansion of our first book Introduction to Graph Theory: H3 Mathematics. While the first book was intended for capable high school students and university freshmen, this version covers substantially more ground and is intended as a reference and textbook for undergraduate studies in Graph Theory. In fact, the topics cover a few modules in the Graph Theory taught at the National University of Singapore. The reader will be challenged and inspired by the material in the book, especially the variety and quality of the problems, which are derived from the authors' years of teaching and research experience.

The book describes up-to-date applications and relevant theoretical results. These applications come from various places, but the most important one, numerically speaking, is the internet based educational system ALEKS. The ALEKS system is bilingual English-Spanish and covers all of mathematics, from third grade to the end of high school, and chemistry. It is also widely used in higher education because US students are often poorly prepared when they reach the university level. The chapter by Taagepera and Arasasingham deals with the application of knowledge spaces, independent of ALEKS, to the teaching of college chemistry. The four chapters by Albert and his collaborators strive to give cognitive interpretations to the combinatoric structures obtained and used by the ALEKS system. The contribution by Eppstein is technical and develops means of searching the knowledge structure efficiently.

Deep learning on graphs has become one of the hottest topics in machine learning. The book consists of four parts to best accommodate our readers with diverse backgrounds and purposes of reading. Part 1 introduces basic concepts of graphs and deep learning; Part 2 discusses the most established methods from the basic to advanced settings; Part 3 presents the most typical applications including natural language processing, computer vision, data mining, biochemistry and healthcare; and Part 4 describes advances of methods and applications that tend to be important and promising for future research. The book is self-contained, making it accessible to a broader range of readers including (1) senior undergraduate and graduate students; (2) practitioners and project managers who want to adopt graph neural networks into their products and platforms; and (3) researchers without a computer science background who want to use graph neural networks to advance their disciplines.

The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficulty and are presented sequentially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathway to voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems - both writing exercises and multiple-choice questions - are included to help develop students' level of understanding and to offer a variety of options to instructors. Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed at undergraduate liberal art students fulfilling the mathematics requirement in their degree program. This introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everyday lives.

This collection honours Ron Doney's work and includes invited articles by his collaborators and friends. After an introduction reviewing Ron Doney's mathematical achievements and how they have influenced the field, the contributed papers cover both discrete-time processes, including random walks and variants thereof, and continuous-time processes, including Le vy processes and diffusions. A good number of the articles are focused on classical fluctuation theory and its ramifications, the area for which Ron Doney is best known.

There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan-Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

This is the first monograph on codebooks and linear codes from difference sets and almost difference sets. It aims at providing a survey of constructions of difference sets and almost difference sets as well as an in-depth treatment of codebooks and linear codes from difference sets and almost difference sets. To be self-contained, this monograph covers necessary mathematical foundations and the basics of coding theory. It also contains tables of best BCH codes and best cyclic codes over GF(2) and GF(3) up to length 125 and 79, respectively. This repository of tables can be used to benchmark newly constructed cyclic codes. This monograph is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications.

Following the basic ideas, standard constructions and important examples in the theory of permutation groups, the book goes on to develop the combinatorial and group theoretic structure of primitive groups leading to the proof of the pivotal ONan-Scott Theorem which links finite primitive groups with finite simple groups. Special topics covered include the Mathieu groups, multiply transitive groups, and recent work on the subgroups of the infinite symmetric groups. With its many exercises and detailed references to the current literature, this text can serve as an introduction to permutation groups in a course at the graduate or advanced undergraduate level, as well as for self-study.

This book gives an overview of research on graphs associated with commutative rings. The study of the connections between algebraic structures and certain graphs, especially finite groups and their Cayley graphs, is a classical subject which has attracted a lot of interest. More recently, attention has focused on graphs constructed from commutative rings, a field of study which has generated an extensive amount of research over the last three decades. The aim of this text is to consolidate this large body of work into a single volume, with the intention of encouraging interdisciplinary research between algebraists and graph theorists, using the tools of one subject to solve the problems of the other. The topics covered include the graphical and topological properties of zero-divisor graphs, total graphs and their transformations, and other graphs associated with rings. The book will be of interest to researchers in commutative algebra and graph theory and anyone interested in learning about the connections between these two subjects.

Combinatorics and Reasoning: Representing, Justifying and Building Isomorphisms is based on the accomplishments of a cohort group of learners from first grade through high school and beyond, concentrating on their work on a set of combinatorics tasks. By studying these students, the editors gain insight into the foundations of proof building, the tools and environments necessary to make connections, activities to extend and generalize combinatoric learning, and even explore implications of this learning on the undergraduate level.

This volume underscores the power of attending to basic ideas in building arguments; it shows the importance of providing opportunities for the co-construction of knowledge by groups of learners; and it demonstrates the value of careful construction of appropriate tasks. Moreover, it documents how reasoning that takes the form of proof evolves with young children and discusses the conditions for supporting student reasoning.

This book builds on two recently published books by the same authors on fuzzy graph theory. Continuing in their tradition, it provides readers with an extensive set of tools for applying fuzzy mathematics and graph theory to social problems such as human trafficking and illegal immigration. Further, it especially focuses on advanced concepts such as connectivity and Wiener indices in fuzzy graphs, distance, operations on fuzzy graphs involving t-norms, and the application of dialectic synthesis in fuzzy graph theory. Each chapter also discusses a number of key, representative applications. Given its approach, the book provides readers with an authoritative, self-contained guide to - and at the same time an inspiring read on - the theory and modern applications of fuzzy graphs. For newcomers, the book also includes a brief introduction to fuzzy sets, fuzzy relations and fuzzy graphs.

This book focuses on a wide range of breakthroughs related to digital biometrics and forensics. The authors introduce the concepts, techniques, methods, approaches and trends needed by cybersecurity specialists and educators for keeping current their biometrics and forensics knowledge. Furthermore, the book provides a glimpse of future directions where biometrics and forensics techniques, policies, applications, and theories are headed. Topics include multimodal biometrics, soft biometrics, mobile biometrics, vehicle biometrics, vehicle forensics, integrity verification of digital content, people identification, biometric-based cybercrime investigation, among others. The book is a rich collection of carefully selected and reviewed manuscripts written by diverse digital biometrics and forensics experts in the listed fields and edited by prominent biometrics and forensics researchers and specialists.

This volume is a collection of research surveys on the Distance Geometry Problem (DGP) and its applications. It will be divided into three parts: Theory, Methods and Applications. Each part will contain at least one survey and several research papers. The first part, Theory, will deal with theoretical aspects of the DGP, including a new class of problems and the study of its complexities as well as the relation between DGP and other related topics, such as: distance matrix theory, Euclidean distance matrix completion problem, multispherical structure of distance matrices, distance geometry and geometric algebra, algebraic distance geometry theory, visualization of K-dimensional structures in the plane, graph rigidity, and theory of discretizable DGP: symmetry and complexity. The second part, Methods, will discuss mathematical and computational properties of methods developed to the problems considered in the first chapter including continuous methods (based on Gaussian and hyperbolic smoothing, difference of convex functions, semidefinite programming, branch-and-bound), discrete methods (based on branch-and-prune, geometric build-up, graph rigidity), and also heuristics methods (based on simulated annealing, genetic algorithms, tabu search, variable neighborhood search). Applications will comprise the third part and will consider applications of DGP to NMR structure calculation, rational drug design, molecular dynamics simulations, graph drawing and sensor network localization. This volume will be the first edited book on distance geometry and applications. The editors are in correspondence with the major contributors to the field of distance geometry, including important research centers in molecular biology such as Institut Pasteur in Paris.

Includes a rich variety of exercises to accompany the exposition of Coxeter groups

Coxeter groups have already been exposited from algebraic and geometric perspectives, but this book will be presenting the combinatorial aspects of Coxeter groups

This book in its Second Edition is a useful, attractive introduction to basic counting techniques for upper secondary to undergraduate students, as well as teachers. Younger students and lay people who appreciate mathematics, not to mention avid puzzle solvers, will also find the book interesting. The various problems and applications here are good for building up proficiency in counting. They are also useful for honing basic skills and techniques in general problem solving. Many of the problems avoid routine and the diligent reader will often discover more than one way of solving a particular problem, which is indeed an important awareness in problem solving. The book thus helps to give students an early start to learning problem-solving heuristics and thinking skills.New chapters originally from a supplementary book have been added in this edition to substantially increase the coverage of counting techniques. The new chapters include the Principle of Inclusion and Exclusion, the Pigeonhole Principle, Recurrence Relations, the Stirling Numbers and the Catalan Numbers. A number of new problems have also been added to this edition.

We propose here a study of 'semiexact' and 'homological' categories as a basis for a generalised homological algebra. Our aim is to extend the homological notions to deeply non-abelian situations, where satellites and spectral sequences can still be studied.This is a sequel of a book on 'Homological Algebra, The interplay of homology with distributive lattices and orthodox semigroups', published by the same Editor, but can be read independently of the latter.The previous book develops homological algebra in p-exact categories, i.e. exact categories in the sense of Puppe and Mitchell - a moderate generalisation of abelian categories that is nevertheless crucial for a theory of 'coherence' and 'universal models' of (even abelian) homological algebra. The main motivation of the present, much wider extension is that the exact sequences or spectral sequences produced by unstable homotopy theory cannot be dealt with in the previous framework.According to the present definitions, a semiexact category is a category equipped with an ideal of 'null' morphisms and provided with kernels and cokernels with respect to this ideal. A homological category satisfies some further conditions that allow the construction of subquotients and induced morphisms, in particular the homology of a chain complex or the spectral sequence of an exact couple.Extending abelian categories, and also the p-exact ones, these notions include the usual domains of homology and homotopy theories, e.g. the category of 'pairs' of topological spaces or groups; they also include their codomains, since the sequences of homotopy 'objects' for a pair of pointed spaces or a fibration can be viewed as exact sequences in a homological category, whose objects are actions of groups on pointed sets.

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. The works cover three fields of mathematics: algebra, geometry and discrete mathematics, discussing the latest developments in the theory of monomial ideals, algebras of graphs and local positivity of line bundles. Whereas interactions between algebra and geometry go back at least to Hilbert, the ties to combinatorics are much more recent and are subject of immense interest at the forefront of contemporary mathematics research. Transplanting methods between different branches of mathematics has proved very fruitful in the past - for example, the application of fixed point theorems in topology to solving nonlinear differential equations in analysis. Similarly, combinatorial structures, e.g., Newton-Okounkov bodies, have led to significant advances in our understanding of the asymptotic properties of line bundles in geometry and multiplier ideals in algebra. This book is intended for advanced graduate students, young scientists and established researchers with an interest in the overlaps between different fields of mathematics. A volume for the 24th edition of this conference was previously published with Springer under the title "Multigraded Algebra and Applications" (ISBN 978-3-319-90493-1).

Graphs and Networks A unique blend of graph theory and network science for mathematicians and data science professionals alike. Featuring topics such as minors, connectomes, trees, distance, spectral graph theory, similarity, centrality, small-world networks, scale-free networks, graph algorithms, Eulerian circuits, Hamiltonian cycles, coloring, higher connectivity, planar graphs, flows, matchings, and coverings, Graphs and Networks contains modern applications for graph theorists and a host of useful theorems for network scientists. The book begins with applications to biology and the social and political sciences and gradually takes a more theoretical direction toward graph structure theory and combinatorial optimization. A background in linear algebra, probability, and statistics provides the proper frame of reference. Graphs and Networks also features: Applications to neuroscience, climate science, and the social and political sciences A research outlook integrated directly into the narrative with ideas for students interested in pursuing research projects at all levels A large selection of primary and secondary sources for further reading Historical notes that hint at the passion and excitement behind the discoveries Practice problems that reinforce the concepts and encourage further investigation and independent work