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.

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

This monograph is devoted to the study of Polygroup Theory. It begins with some basic results concerning group theory and algebraic hyperstructures, which represent the most general algebraic context, in which reality can be modeled. Most results on polygroups are collected in this book. Moreover, this monograph is the first book on this theory. The volume is highly recommended to theoreticians in pure and applied mathematics.

Algebraic graph theory is a fascinating subject concerned with the interplay between algebra and graph theory. Algebraic tools can be used to give surprising and elegant proofs of graph theoretic facts, and there are many interesting algebraic objects associated with graphs. The authors take an inclusive view of the subject, and present a wide range of topics. These range from standard classics, such as the characterization of line graphs by eigenvalues, to more unusual areas such as geometric embeddings of graphs and the study of graph homomorphisms. The authors' goal has been to present each topic in a self-contained fashion, presenting the main tools and ideas, with an emphasis on their use in understanding concrete examples. A substantial proportion of the book covers topics that have not appeared in book form before, and as such it provides an accessible introduction to the research literature and to important open questions in modern algebraic graph theory. This book is primarily aimed at graduate students and researchers in graph theory, combinatorics, or discrete mathematics in general. However, all the necessary graph theory is developed from scratch, so the only pre-requisite for reading it is a first course in linear algebra and a small amount of elementary group theory. It should be accessible to motivated upper-level undergraduates. Chris Godsil is a full professor in the Department of Combinatorics and Optimization at the University of Waterloo. His main research interests lie in the interactions between algebra and combinatorics, in particular the application of algebraic techniques to graphs, designs and codes. He has published more than 70 papers in these areas, is a founding editor of "The Journal of Algebraic Combinatorics" and is the author of the book "Algebraic Combinatorics". Gordon Royle teaches in the Department of Computer Science & Software Engineering at the University of Western Australia. His main research interests lie in the application of computers to combinatorial problems, in particular the cataloguing, enumeration and investigation of graphs, designs and finite geometries. He has published more than 30 papers in graph theory, design theory and finite geometry.

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski s quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways: as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form ( cylindric in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin. "

This volume collects selected papers from the 7th High Dimensional Probability meeting held at the Institut d'Etudes Scientifiques de Cargese (IESC) in Corsica, France. High Dimensional Probability (HDP) is an area of mathematics that includes the study of probability distributions and limit theorems in infinite-dimensional spaces such as Hilbert spaces and Banach spaces. The most remarkable feature of this area is that it has resulted in the creation of powerful new tools and perspectives, whose range of application has led to interactions with other subfields of mathematics, statistics, and computer science. These include random matrices, nonparametric statistics, empirical processes, statistical learning theory, concentration of measure phenomena, strong and weak approximations, functional estimation, combinatorial optimization, and random graphs. The contributions in this volume show that HDP theory continues to thrive and develop new tools, methods, techniques and perspectives to analyze random phenomena.

Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.

On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs is a compilation of many of the exciting results concerning Laplacian matrices developed since the mid 1970s by well-known mathematicians such as Fallat, Fiedler, Grone, Kirkland, Merris, Mohar, Neumann, Shader, Sunder, and more. The text is complemented by many examples and detailed calculations, and sections followed by exercises to aid the reader in gaining a deeper understanding of the material. Although some exercises are routine, others require a more in-depth analysis of the theorems and ask the reader to prove those that go beyond what was presented in the section. Matrix-graph theory is a fascinating subject that ties together two seemingly unrelated branches of mathematics. Because it makes use of both the combinatorial properties and the numerical properties of a matrix, this area of mathematics is fertile ground for research at the undergraduate, graduate, and professional levels. This book can serve as exploratory literature for the undergraduate student who is just learning how to do mathematical research, a useful "start-up" book for the graduate student beginning research in matrix-graph theory, and a convenient reference for the more experienced researcher.

RC4 Stream Cipher and Its Variants is the first book to fully cover the popular software stream cipher RC4. With extensive expertise in stream cipher cryptanalysis and RC4 research, the authors focus on the analysis and design issues of RC4. They also explore variants of RC4 and the eSTREAM finalist HC-128. After an introduction to the vast field of cryptology, the book reviews hardware and software stream ciphers and describes RC4. It presents a theoretical analysis of RC4 KSA, discussing biases of the permutation bytes toward secret key bytes and absolute values. The text explains how to reconstruct the secret key from known state information and analyzes the RC4 PRGA in detail, including a sketch of state recovery attacks. The book then describes three popular attacks on RC4: distinguishing attacks, Wired Equivalent Privacy (WEP) protocol attacks, and fault attacks. The authors also compare the advantages and disadvantages of several variants of RC4 and examine stream cipher HC-128, which is the next level of evolution after RC4 in the software stream cipher paradigm. The final chapter emphasizes the safe use of RC4. With open research problems in each chapter, this book offers a complete account of the most current research on RC4.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to [email protected].

This book focuses on the application of virtual reality (VR) technology in mining machinery. It gives a detailed introduction to the application of VR technology in virtual assembly, virtual planning, and virtual monitoring. Based on the theory of digital twin, VR technology and collaborative control technology are applied to coal mining machinery equipment, which lays a foundation for the digitalization and intellectualization of coal machinery equipment and broadens the application scope of virtual reality technology in the mechanical engineering field. Through the application of VR technology in coal machinery equipment, this book provides new methods and ideas for teaching activities, scientific research activities, and actual production with rich illustrations, related table introduction, unique research ideas, and other unique contents. This book could be a useful reference for researchers in mining machinery, simulation and modeling, computer-aided engineering (CAD and CAE) and design, visualization, mechanical engineering, and other disciplines.

In this volume very simplified models are introduced to understand the random sequential packing models mathematically. The 1-dimensional model is sometimes called the Parking Problem, which is known by the pioneering works by Flory (1939), Renyi (1958), Dvoretzky and Robbins (1962). To obtain a 1-dimensional packing density, distribution of the minimum of gaps, etc., the classical analysis has to be studied. The packing density of the general multi-dimensional random sequential packing of cubes (hypercubes) makes a well-known unsolved problem. The experimental analysis is usually applied to the problem. This book introduces simplified multi-dimensional models of cubes and torus, which keep the character of the original general model, and introduces a combinatorial analysis for combinatorial modelings.

The matching problem is one of the central problems in graph theory as well as in the theory of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. The text is written for students at the beginning graduate level. The exposition is mostly self-contained and example-driven. Prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and should also be of interest to research workers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are combined into three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the main goals of the book is to bring together these three approaches and highlight how their combination works in the development of efficient parallel algorithms. The reader will be provided with a simple and transparent presentation of a variety of interesting algorithms, including many examples and illustrations. The combination of different approaches makes the matching problem and its applications an attractive and fascinating subject. It is hoped that the book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas. Marek Karpinski is Chair Professor of Computer Science at the University of Bonn. Wojciech Rytter is Professor of Computer Science at the University of Warsaw and at the University of Liverpool.

Buildings are combinatorial constructions successfully exploited to study groups of various types. The vertex set of a building can be naturally decomposed into subsets called Grassmannians. The book contains both classical and more recent results on Grassmannians of buildings of classical types. It gives a modern interpretation of some classical results from the geometry of linear groups. The presented methods are applied to some geometric constructions non-related to buildings Grassmannians of infinite-dimensional vector spaces and the sets of conjugate linear involutions.

The book is self-contained and the requirement for the reader is a knowledge of basic algebra and graph theory. This makes it very suitable for use in a course for graduate students.

The 2017 PIMS-CRM Summer School in Probability was held at the Pacific Institute for the Mathematical Sciences (PIMS) at the University of British Columbia in Vancouver, Canada, during June 5-30, 2017. It had 125 participants from 20 different countries, and featured two main courses, three mini-courses, and twenty-nine lectures. The lecture notes contained in this volume provide introductory accounts of three of the most active and fascinating areas of research in modern probability theory, especially designed for graduate students entering research: Scaling limits of random trees and random graphs (Christina Goldschmidt) Lectures on the Ising and Potts models on the hypercubic lattice (Hugo Duminil-Copin) Extrema of the two-dimensional discrete Gaussian free field (Marek Biskup) Each of these contributions provides a thorough introduction that will be of value to beginners and experts alike.

In 1736, the mathematician Euler invented graph theory while solving the Konigsberg seven-bridge problem. Over 200 years later, graph theory remains the skeleton content of discrete mathematics, which serves as a theoretical basis for computer science and network information science. This book introduces some basic knowledge and the primary methods in graph theory by many interesting problems and games.

Approaches to the recovery of three-dimensional information on a biological object, which are often formulated or implemented initially in an intuitive way, are concisely described here based on physical models of the object and the image-formation process. Both three-dimensional electron microscopy and X-ray tomography can be captured in the same mathematical framework, leading to closely-related computational approaches, but the methodologies differ in detail and hence pose different challenges. The editors of this volume, Gabor T. Herman and Joachim Frank, are experts in the respective methodologies and present research at the forefront of biological imaging and structural biology. Computational Methods for Three-Dimensional Microscopy Reconstruction will serve as a useful resource for scholars interested in the development of computational methods for structural biology and cell biology, particularly in the area of 3D imaging and modeling.

Combinatorics of Spreads and Parallelisms covers all known finite and infinite parallelisms as well as the planes comprising them. It also presents a complete analysis of general spreads and partitions of vector spaces that provide groups enabling the construction of subgeometry partitions of projective spaces. The book describes general partitions of finite and infinite vector spaces, including Sperner spaces, focal-spreads, and their associated geometries. Since retraction groups provide quasi-subgeometry and subgeometry partitions of projective spaces, the author thoroughly discusses subgeometry partitions and their construction methods. He also features focal-spreads as partitions of vector spaces by subspaces. In addition to presenting many new examples of finite and infinite parallelisms, the book shows that doubly transitive or transitive t-parallelisms cannot exist unless the parallelism is a line parallelism. Along with the author's other three books (Subplane Covered Nets, Foundations of Translation Planes, Handbook of Finite Translation Planes), this text forms a solid, comprehensive account of the complete theory of the geometries that are connected with translation planes in intricate ways. It explores how to construct interesting parallelisms and how general spreads of vector spaces are used to study and construct subgeometry partitions of projective spaces.

The papers in this volume are based on lectures given at the IMA Workshop on Grid Generation and Adaptive Algorithms held during April 28 - May 2, 1997. Grid generation is a common feature of many computational tasks which require the discretization and representation of space and surfaces. The papers in this volume discuss how the geometric complexity of the physical object or the non-uniform nature of the solution variable make it impossible to use a uniform grid. Since an efficient grid requires knowledge of the computed solution, many of the papers in this volume treat how to construct grids that are adaptively computed with the solution. This volume will be of interest to computational scientists and mathematicians working in a broad variety of applications including fluid mechanics, solid mechanics, materials science, chemistry, and physics. Papers treat residual-based error estimation and adaptivity, repartitioning and load balancing for adaptive meshes, data structures and local refinement methods for conservation laws, adaptivity for hp-finite element methods, the resolution of boundary layers in high Reynolds number flow, adaptive methods for elastostatic contact problems, the full domain partition approach to parallel adaptive refinement, the adaptive solution of phase change problems, and quality indicators for triangular meshes.

Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page reference for every citing in the bibliography and more than 1,500 entries in the index so that students can easily cross-reference and find the appropriate data.

With numerous examples throughout, the text begins with coverage of algebraic number theory, binary quadratic forms, Diophantine approximation, arithmetic functions, p-adic analysis, Dirichlet characters, density, and primes in arithmetic progression. It then applies these tools to Diophantine equations, before developing elliptic curves and modular forms. The text also presents an overview of Fermat's Last Theorem (FLT) and numerous consequences of the ABC conjecture, including Thue-Siegel-Roth theorem, Hall's conjecture, the Erdos-Mollin--Walsh conjecture, and the Granville-Langevin Conjecture. In the appendix, the author reviews sieve methods, such as Eratothesenes', Selberg's, Linnik's, and Bombieri's sieves. He also discusses recent results on gaps between primes and the use of sieves in factoring.

By focusing on salient techniques in number theory, this textbook provides the most up-to-date and comprehensive material for a second course in this field. It prepares students for future study at the graduate level."

This book provides a complete introduction into spatial networks. It offers the mathematical tools needed to characterize these structures and how they evolve in time and presents the most important models of spatial networks. The book puts a special emphasis on analyzing complex systems which are organized under the form of networks where nodes and edges are embedded in space. In these networks, space is relevant, and topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. This subject is therefore at the crossroad of many fields and is of potential interest to a broad audience comprising physicists, mathematicians, engineers, geographers or urbanists. In this book, the author has expanded his previous book ("Morphogenesis of Spatial Networks") to serve as a textbook and reference on this topic for a wide range of students and professional researchers.

A lively invitation to the flavor, elegance, and power of graph theory

This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory.

Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1–3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to Pólya’s enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra.

The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject.

This book offers an introduction to the theory of groupoids and their representations encompassing the standard theory of groups. Using a categorical language, developed from simple examples, the theory of finite groupoids is shown to knit neatly with that of groups and their structure as well as that of their representations is described. The book comprises numerous examples and applications, including well-known games and puzzles, databases and physics applications. Key concepts have been presented using only basic notions so that it can be used both by students and researchers interested in the subject. Category theory is the natural language that is being used to develop the theory of groupoids. However, categorical presentations of mathematical subjects tend to become highly abstract very fast and out of reach of many potential users. To avoid this, foundations of the theory, starting with simple examples, have been developed and used to study the structure of finite groups and groupoids. The appropriate language and notions from category theory have been developed for students of mathematics and theoretical physics. The book presents the theory on the same level as the ordinary and elementary theories of finite groups and their representations, and provides a unified picture of the same. The structure of the algebra of finite groupoids is analysed, along with the classical theory of characters of their representations. Unnecessary complications in the formal presentation of the subject are avoided. The book offers an introduction to the language of category theory in the concrete setting of finite sets. It also shows how this perspective provides a common ground for various problems and applications, ranging from combinatorics, the topology of graphs, structure of databases and quantum physics.

Unlike most elementary books on matrices, A Combinatorial Approach to Matrix Theory and Its Applications employs combinatorial and graph-theoretical tools to develop basic theorems of matrix theory, shedding new light on the subject by exploring the connections of these tools to matrices.

After reviewing the basics of graph theory, elementary counting formulas, fields, and vector spaces, the book explains the algebra of matrices and uses the Konig digraph to carry out simple matrix operations. It then discusses matrix powers, provides a graph-theoretical definition of the determinant using the Coates digraph of a matrix, and presents a graph-theoretical interpretation of matrix inverses. The authors develop the elementary theory of solutions of systems of linear equations and show how to use the Coates digraph to solve a linear system. They also explore the eigenvalues, eigenvectors, and characteristic polynomial of a matrix; examine the important properties of nonnegative matrices thatare part of the Perron-Frobenius theory; and study eigenvalue inclusion regions and sign-nonsingular matrices. The final chapter presents applications to electrical engineering, physics, and chemistry.

Using combinatorial and graph-theoretical tools, this book enables a solid understanding of the fundamentals of matrix theory and its application to scientific areas.

Features Provides a uniquely historical perspective on the mathematical underpinnings of a comprehensive list of games Suitable for a broad audience of differing mathematical levels. Anyone with a passion for games, game theory, and mathematics will enjoy this book, whether they be students, academics, or game enthusiasts Covers a wide selection of topics at a level that can be appreciated on a historical, recreational, and mathematical level.