Multilayer networks is a rising topic in Network Science which characterizes the structure and the function of complex systems formed by several interacting networks. Multilayer networks research has been propelled forward by the wide realm of applications in social, biological and infrastructure networks and the large availability of network data, as well as by the significance of recent results, which have produced important advances in this rapidly growing field. This book presents a comprehensive account of this emerging field. It provides a theoretical introduction to the main results of multilayer network science.

The second volume of this work contains Parts 2 and 3 of the "Handbook of Coding Theory". Part 2, "Connections", is devoted to connections between coding theory and other branches of mathematics and computer science. Part 3, "Applications", deals with a variety of applications for coding.

Weyl group multiple Dirichlet series are generalizations of the Riemann zeta function. Like the Riemann zeta function, they are Dirichlet series with analytic continuation and functional equations, having applications to analytic number theory. By contrast, these Weyl group multiple Dirichlet series may be functions of several complex variables and their groups of functional equations may be arbitrary finite Weyl groups. Furthermore, their coefficients are multiplicative up to roots of unity, generalizing the notion of Euler products. This book proves foundational results about these series and develops their combinatorics.

These interesting functions may be described as Whittaker coefficients of Eisenstein series on metaplectic groups, but this characterization doesn't readily lead to an explicit description of the coefficients. The coefficients may be expressed as sums over Kashiwara crystals, which are combinatorial analogs of characters of irreducible representations of Lie groups. For Cartan Type A, there are two distinguished descriptions, and if these are known to be equal, the analytic properties of the Dirichlet series follow. Proving the equality of the two combinatorial definitions of the Weyl group multiple Dirichlet series requires the comparison of two sums of products of Gauss sums over lattice points in polytopes. Through a series of surprising combinatorial reductions, this is accomplished.

The book includes expository material about crystals, deformations of the Weyl character formula, and the Yang-Baxter equation.

"Presents the latest in graph domination by leading researchers from around the world-furnishing known results, open research problems, and proof techniques. Maintains standardized terminology and notation throughout for greater accessibility. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on chessboards, and more."

Through three editions, Cryptography: Theory and Practice, has been embraced by instructors and students alike. It offers a comprehensive primer for the subject's fundamentals while presenting the most current advances in cryptography. The authors offer comprehensive, in-depth treatment of the methods and protocols that are vital to safeguarding the seemingly infinite and increasing amount of information circulating around the world. Key Features of the Fourth Edition: New chapter on the exciting, emerging new area of post-quantum cryptography (Chapter 9). New high-level, nontechnical overview of the goals and tools of cryptography (Chapter 1). New mathematical appendix that summarizes definitions and main results on number theory and algebra (Appendix A). An expanded treatment of stream ciphers, including common design techniques along with coverage of Trivium. Interesting attacks on cryptosystems, including: padding oracle attack correlation attacks and algebraic attacks on stream ciphers attack on the DUAL-EC random bit generator that makes use of a trapdoor. A treatment of the sponge construction for hash functions and its use in the new SHA-3 hash standard. Methods of key distribution in sensor networks. The basics of visual cryptography, allowing a secure method to split a secret visual message into pieces (shares) that can later be combined to reconstruct the secret. The fundamental techniques cryptocurrencies, as used in Bitcoin and blockchain. The basics of the new methods employed in messaging protocols such as Signal, including deniability and Diffie-Hellman key ratcheting.

Based on talks from the 2017 and 2018 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 17 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003, the workshop series surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Topics featured in this volume include sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, commutative algebra and discrete geometry, and applications of logic and nonstandard analysis to number theory. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. This selection of articles will be of relevance to both researchers and graduate students interested in current progress in number theory.

The ancient game of Go is one of the less obvious candidates for mathematical analysis. With the development of new concepts in combinatorial game theory, the authors have been able to analyze Go games and find solutions to real endgame problems that have stumped professional Go players. Go players with an interest in mathematics and mathematicians who work in game theory will not want to miss this book because it describes substantial connections between the two subjects that have been, until now, largely unrecognized.

This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields. We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm. The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science. The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory. Aimed at graduate students and professionals in both mathematics and computer science The first book of its kind devoted to the topic Authored by a noted authority in crossing numbers

Decomposing an abelian group into a direct sum of its subsets leads to results that can be applied to a variety of areas, such as number theory, geometry of tilings, coding theory, cryptography, graph theory, and Fourier analysis. Focusing mainly on cyclic groups, Factoring Groups into Subsets explores the factorization theory of abelian groups. The book first shows how to construct new factorizations from old ones. The authors then discuss nonperiodic and periodic factorizations, quasiperiodicity, and the factoring of periodic subsets. They also examine how tiling plays an important role in number theory. The next several chapters cover factorizations of infinite abelian groups; combinatorics, such as Ramsey numbers, Latin squares, and complex Hadamard matrices; and connections with codes, including variable length codes, error correcting codes, and integer codes. The final chapter deals with several classical problems of Fuchs. Encompassing many of the main areas of the factorization theory, this book explores problems in which the underlying factored group is cyclic.

To truly understand how the Internet and Web are organized and function requires knowledge of mathematics and computation theory. Mathematical and Algorithmic Foundations of the Internet introduces the concepts and methods upon which computer networks rely and explores their applications to the Internet and Web. The book offers a unique approach to mathematical and algorithmic concepts, demonstrating their universality by presenting ideas and examples from various fields, including literature, history, and art. Progressing from fundamental concepts to more specific topics and applications, the text covers computational complexity and randomness, networks and graphs, parallel and distributed computing, and search engines. While the mathematical treatment is rigorous, it is presented at a level that can be grasped by readers with an elementary mathematical background. The authors also present a lighter side to this complex subject by illustrating how many of the mathematical concepts have counterparts in everyday life. The book provides in-depth coverage of the mathematical prerequisites and assembles a complete presentation of how computer networks function. It is a useful resource for anyone interested in the inner functioning, design, and organization of the Internet.

The Rogers--Ramanujan identities are a pair of infinite series-infinite product identities that were first discovered in 1894. Over the past several decades these identities, and identities of similar type, have found applications in number theory, combinatorics, Lie algebra and vertex operator algebra theory, physics (especially statistical mechanics), and computer science (especially algorithmic proof theory). Presented in a coherant and clear way, this will be the first book entirely devoted to the Rogers-Ramanujan identities and will include related historical material that is unavailable elsewhere.

Network science is a rapidly emerging field of study that encompasses mathematics, computer science, physics, and engineering. A key issue in the study of complex networks is to understand the collective behavior of the various elements of these networks. Although the results from graph theory have proven to be powerful in investigating the structures of complex networks, few books focus on the algorithmic aspects of complex network analysis. Filling this need, Complex Networks: An Algorithmic Perspective supplies the basic theoretical algorithmic and graph theoretic knowledge needed by every researcher and student of complex networks. This book is about specifying, classifying, designing, and implementing mostly sequential and also parallel and distributed algorithms that can be used to analyze the static properties of complex networks. Providing a focused scope which consists of graph theory and algorithms for complex networks, the book identifies and describes a repertoire of algorithms that may be useful for any complex network. Provides the basic background in terms of graph theory Supplies a survey of the key algorithms for the analysis of complex networks Presents case studies of complex networks that illustrate the implementation of algorithms in real-world networks, including protein interaction networks, social networks, and computer networks Requiring only a basic discrete mathematics and algorithms background, the book supplies guidance that is accessible to beginning researchers and students with little background in complex networks. To help beginners in the field, most of the algorithms are provided in ready-to-be-executed form. While not a primary textbook, the author has included pedagogical features such as learning objectives, end-of-chapter summaries, and review questions

A Tour Through Graph Theory introduces graph theory to students who are not mathematics majors. Rather than featuring formal mathematical proofs, the book focuses on explanations and logical reasoning. It also includes thoughtful discussions of historical problems and modern questions. The book inspires readers to learn by working through examples, drawing graphs and exploring concepts. This book distinguishes itself from others covering the same topic. It strikes a balance of focusing on accessible problems for non-mathematical students while providing enough material for a semester-long course. Employs graph theory to teach mathematical reasoning Expressly written for non-mathematical students Promotes critical thinking and problem solving Provides rich examples and clear explanations without using proofs

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world-as researchers in mathematics and computer science-and in the professional world-as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

An advanced reference containing 21 selected or consolidated papers presented at an international conference in April 1988 at Tunxi (now Hunangshan), China. Contains recent, previously unavailable findings of Chinese mathematicians; discusses problems, results, and proving methods of combinatorial d

The Star and the Whole: Gian-Carlo Rota on Mathematics and Phenomenology, authored by Fabrizio Palombi, is the first book to study Rota's philosophical reflection. Rota (1932 1999) was a leading figure in contemporary mathematics and an outstanding philosopher, inspired by phenomenology, who made fundamental contributions to combinatorial analysis, and trained several generations of mathematicians in his long career at the Massachusetts Institute of Technology (MIT) and the Los Alamos National Laboratory. The first chapter of the book reconstructs Rota's cultural biography and examines his philosophical style, his criticisms of analytical philosophy, and his reflection on Heidegger's thought. The second chapter presents a general picture of Rota's re-elaboration of phenomenology examined in the light of the Husserlian notion of Fundierung. This chapter also illustrates how the star-shape becomes a powerful instrument for understanding the properties of Husserl's mereology and the critique of objectivism. The third chapter is a theoretical reflection on the nature of mathematical entities, and the fourth examines the complex relation of mathematical research with technological applicability and scientific progress. The foreword of the text is written by Robert Sokolowski.

An Atlas Of Edge-Reversal Dynamics is the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal), a powerful distributed mechanism for scheduling agents in a computer system. The study of SER draws on strong motivation from several areas of application, and reveals very clearly the emergence of complex dynamic behavior from very simple transition rules. As such, SER provides the opportunity for the study of complex graph dynamics that can be applied to computer science, optimization, artificial intelligence, networks of automata, and other complex systems. In Part 1: Edge-Reversal Dynamics, the author discusses the main applications and properties of SER, provides data from statistics and correlations computed over several graph classes, and gives an overview of the algorithmic aspects of the construction of the catalogue, thus summarizing the methodology and findings of the cataloguing effort. Part 2: The Atlas, comprises the atlas proper-a catalogue of graphical representations of all basins of attraction generated by the SER mechanism for all graphs in selected classes. An Atlas Of Edge-Reversal Dynamics is a unique and detailed treatment of SER. Along with the catalogue, discussions of SER in the contexts of resource-sharing and automaton networks and a comprehensive set of references make this an important resource for researchers and graduate students in graph theory, discrete mathematics, and complex systems.

This volume focuses on the classical theory of number-theoretic functions emphasizing algebraic and multiplicative techniques. It contains many structure theorems basic to the study of arithmetic functions, including several previously unpublished proofs. The author is head of the Dept. of Mathemati

Representation Theory of Symmetric Groups is the most up-to-date abstract algebra book on the subject of symmetric groups and representation theory. Utilizing new research and results, this book can be studied from a combinatorial, algorithmic or algebraic viewpoint. This book is an excellent way of introducing today's students to representation theory of the symmetric groups, namely classical theory. From there, the book explains how the theory can be extended to other related combinatorial algebras like the Iwahori-Hecke algebra. In a clear and concise manner, the author presents the case that most calculations on symmetric group can be performed by utilizing appropriate algebras of functions. Thus, the book explains how some Hopf algebras (symmetric functions and generalizations) can be used to encode most of the combinatorial properties of the representations of symmetric groups. Overall, the book is an innovative introduction to representation theory of symmetric groups for graduate students and researchers seeking new ways of thought.

Combining theoretical and practical aspects of topology, this book provides a comprehensive and self-contained introduction to topological methods for the analysis and visualization of scientific data. Theoretical concepts are presented in a painstaking but intuitive manner, with numerous high-quality color illustrations. Key algorithms for the computation and simplification of topological data representations are described in detail, and their application is carefully demonstrated in a chapter dedicated to concrete use cases. With its fine balance between theory and practice, "Topological Data Analysis for Scientific Visualization" constitutes an appealing introduction to the increasingly important topic of topological data analysis for lecturers, students and researchers.

What Is Combinatorics Anyway? Broadly speaking, combinatorics is the branch of mathematics dealing with different ways of selecting objects from a set or arranging objects. It tries to answer two major kinds of questions, namely, counting questions: how many ways can a selection or arrangement be chosen with a particular set of properties; and structural questions: does there exist a selection or arrangement of objects with a particular set of properties? The authors have presented a text for students at all levels of preparation. For some, this will be the first course where the students see several real proofs. Others will have a good background in linear algebra, will have completed the calculus stream, and will have started abstract algebra. The text starts by briefly discussing several examples of typical combinatorial problems to give the reader a better idea of what the subject covers. The next chapters explore enumerative ideas and also probability. It then moves on to enumerative functions and the relations between them, and generating functions and recurrences., Important families of functions, or numbers and then theorems are presented. Brief introductions to computer algebra and group theory come next. Structures of particular interest in combinatorics: posets, graphs, codes, Latin squares, and experimental designs follow. The authors conclude with further discussion of the interaction between linear algebra and combinatorics. Features Two new chapters on probability and posets. Numerous new illustrations, exercises, and problems. More examples on current technology use A thorough focus on accuracy Three appendices: sets, induction and proof techniques, vectors and matrices, and biographies with historical notes, Flexible use of MapleTM and MathematicaTM

This book is a compilation of the papers presented at the conference in Winnipeg on the subject of finite geometry in 1984. It covers different fields in finite geometry: classical finite geometry, the geometry of finite planes, geometric structures and the theory of translation planes.