This edited volume focuses on the latest developments in classification and data science and covers a wide range of topics in the context of data analysis and related areas, e.g. the analysis of complex data, analysis of qualitative data, methods for high-dimensional data, dimensionality reduction, data visualization, multivariate statistical methods, and various applications to real data in the social sciences, medical sciences, and other disciplines. In addition to sharing theoretical and methodological findings, the book shows how to apply the proposed methods to a variety of problems - e.g. in consumer behavior, decision-making, marketing data and social network structures. Both methodological aspects and applications to a wide range of areas such as economics, behavioral science, marketing science, management science and the social sciences are covered. The book is chiefly intended for researchers and practitioners who are interested in the latest developments and practical applications in these fields, as well as applied statisticians and data analysts. Its combination of methodological advances with a wide range of real-world applications gathered from several fields makes it of unique value in helping readers solve their research problems.

The focus of this book is on combinatorial objects, dessins d'enfants, which are drawings with vertices and edges on topological surfaces. Their interest lies in their relation with the set of algebraic curves defined over the closure of the rationals, and the corresponding action of the absolute Galois group on them. The articles contained here unite basic elements of the subject with recent advances. Topics covered include: the explicity association of algebraic curves to dessins, the study of the action of the Galois group on the dessins, computation and combinatorics, relations with modular forms, geometry, generating functions, TeichmÜller and moduli spaces. Researchers in number theory, algebraic geometry or related areas of group theory will find much of interest in this book.

This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.

In this substantial revision of a much-quoted monograph first published in 1974, Dr. Biggs aims to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first section, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject that has strong links with the "interaction models" studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. The structure of the volume is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of "Additional Results" are included at the end of each chapter, thereby covering most of the major advances in the past twenty years. This new and enlarged edition will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.

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 second volume of the Geometry of Algebraic Curves is devoted to the foundations of the theory of moduli of algebraic curves. Its authors are research mathematicians who have actively participated in the development of the Geometry of Algebraic Curves. The subject is an extremely fertile and active one, both within the mathematical community and at the interface with the theoretical physics community. The approach is unique in its blending of algebro-geometric, complex analytic and topological/combinatorial methods. It treats important topics such as Teichmuller theory, the cellular decomposition of moduli and its consequences and the Witten conjecture. The careful and comprehensive presentation of the material is of value to students who wish to learn the subject and to experts as a reference source. The first volume appeared 1985 as vol. 267 of the same series.

Bringing together key researchers in disciplines ranging from visualization and image processing to applications in structural mechanics, fluid dynamics, elastography, and numerical mathematics, the workshop that generated this edited volume was the third in the successful Dagstuhl series. Its aim, reflected in the quality and relevance of the papers presented, was to foster collaboration and fresh lines of inquiry in the analysis and visualization of tensor fields, which offer a concise model for numerous physical phenomena. Despite their utility, there remains a dearth of methods for studying all but the simplest ones, a shortage the workshops aim to address. Documenting the latest progress and open research questions in tensor field analysis, the chapters reflect the excitement and inspiration generated by this latest Dagstuhl workshop, held in July 2009. The topics they address range from applications of the analysis of tensor fields to purer research into their mathematical and analytical properties. They show how cooperation and the sharing of ideas and data between those engaged in pure and applied research can open new vistas in the study of tensor fields.

This book explores topics in Gallai-Ramsey theory, which looks into whether rainbow colored subgraphs or monochromatic subgraphs exist in a sufficiently large edge-colored complete graphs. A comprehensive survey of all known results with complete references is provided for common proof methods. Fundamental definitions and preliminary results with illustrations guide readers to comprehend recent innovations. Complete proofs and influential results are discussed with numerous open problems and conjectures. Researchers and students with an interest in edge-coloring, Ramsey Theory, and colored subgraphs will find this book a valuable guide for entering Gallai-Ramsey Theory.

Plastics, films, and synthetic fibers are among typical examples of polymer materials fabricated industrially in massive quantities as the basis of modern social life. By comparison, polymers from biological resources, including proteins, DNAs, and cotton fibers, are essential in various processes in living systems. Such polymers are molecular substances, constituted by the linking of hundreds to tens of thousands of small chemical unit (monomer) components. Thus, the form of polymer molecules is frequently expressed by line geometries, and their linear and non-linear forms are believed to constitute the fundamental basis for their properties and functions. In the field of polymer chemistry and polymer materials science, the choice of macromolecules has continuously been extended from linear or randomly branched forms toward a variety of precisely controlled topologies by the introduction of intriguing synthetic techniques. Moreover, during the first decade of this century, a number of impressive breakthroughs have been achieved to produce an important class of polymers having a variety of cyclic and multicyclic topologies. These developments now offer unique opportunities in polymer materials design to create unique properties and functions based on the form, i.e., topology, of polymer molecules. The introduction and application of topological geometry (soft geometry) to polymer molecules is a crucial requirement to account for the basic geometrical properties of polymer chains uniquely flexible in nature, in contrast to small chemical compounds conceived upon Euclidian geometry (hard geometry) principles. Topological geometry and graph theory are introduced for the systematic classification and notation of the non-linear constructions of polymer molecules, including not only branched but also single cyclic and multicyclic polymer topologies. On that basis, the geometrical-topological relationship between different polymers having distinctive constructions is discussed. A unique conception of topological isomerism is thus formed, which contrasts with that of conventional constitutional and stereoisomerism occurring in small chemical compounds. Through the close collaboration of topology experts Shimokawa and Ishihara and the polymer chemist Tezuka, this monograph covers the fundamentals and selected current topics of topology applied in polymers and topological polymer chemistry. In particular, the aim is to provide novel insights jointly revealed through a unique interaction between mathematics (topology) and polymer materials science.

This book sets out an account of the tools which Frobenius used to discover representation theory for nonabelian groups and describes its modern applications. It provides a new viewpoint from which one can examine various aspects of representation theory and areas of application, such as probability theory and harmonic analysis. For example, the focal objects of this book, group matrices, can be thought of as a generalization of the circulant matrices which are behind many important algorithms in information science. The book is designed to appeal to several audiences, primarily mathematicians working either in group representation theory or in areas of mathematics where representation theory is involved. Parts of it may be used to introduce undergraduates to representation theory by studying the appealing pattern structure of group matrices. It is also intended to attract readers who are curious about ideas close to the heart of group representation theory, which do not usually appear in modern accounts, but which offer new perspectives.

This book constitutes the thoroughly refereed post-conference proceedings of the 5th International Symposium on Combinatorial Optimization, ISCO 2018, held in Marrakesh, Marocco, in April 2018. The 35 revised full papers presented in this book were carefully reviewed and selected from 75 submissions. The symposium aims to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming and operations research.

This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and problems that researchers may not be aware of but may find of interest. Each chapter contains results, methods and information that will give readers the necessary background to investigate each topic in more detail.

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. Utilizing a previously unexplored connection between combinatorics and Fourier analysis, this method will allow readers to move to higher-dimensional lattice path problems with ease. The technique is carefully developed in the first three chapters using the algebraic properties of the DFT, moving from one-dimensional problems to higher dimensions. In the following chapter, the discussion turns to geometric properties of the DFT in order to study the corridor state space. Each chapter poses open-ended questions and exercises to prompt further practice and future research. Two appendices are also provided, which cover complex variables and non-rectangular lattices, thus ensuring the text will be self-contained and serve as a valued reference. Counting Lattice Paths Using Fourier Methods is ideal for upper-undergraduates and graduate students studying combinatorics or other areas of mathematics, as well as computer science or physics. Instructors will also find this a valuable resource for use in their seminars. Readers should have a firm understanding of calculus, including integration, sequences, and series, as well as a familiarity with proofs and elementary linear algebra.

Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 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. Sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, primality testing, and cryptography are among the topics featured in this volume. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling.

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. It introduces readers to this striking new approach to network coding, in which the network is not simply viewed as a mechanism for delivering packets, but rather an algebraic structure named the subspace, which these packets span. This leads to a new kind of coding theory, employing what are called subspace codes. The book presents selected, highly relevant advanced research output on: Subspace Codes and Rank Metric Codes; Finite Geometries and Subspace Designs; Application of Network Coding; Codes for Distributed Storage Systems. The outcomes reflect research conducted within the framework of the European COST Action IC1104: Random Network Coding and Designs over GF(q). Taken together, they offer communications engineers, R&D engineers, researchers and graduate students in Mathematics, Computer Science, and Electrical Engineering a comprehensive reference guide to the construction of optimal network codes, as well as efficient encoding and decoding schemes for a given network code.

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.

Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.

This textbook provides an introduction to the combinatorial and statistical aspects of commutative algebra with an emphasis on binomial ideals. In addition to thorough coverage of the basic concepts and theory, it explores current trends, results, and applications of binomial ideals to other areas of mathematics. The book begins with a brief, self-contained overview of the modern theory of Groebner bases and the necessary algebraic and homological concepts from commutative algebra. Binomials and binomial ideals are then considered in detail, along with a short introduction to convex polytopes. Chapters in the remainder of the text can be read independently and explore specific aspects of the theory of binomial ideals, including edge rings and edge polytopes, join-meet ideals of finite lattices, binomial edge ideals, ideals generated by 2-minors, and binomial ideals arising from statistics. Each chapter concludes with a set of exercises and a list of related topics and results that will complement and offer a better understanding of the material presented. Binomial Ideals is suitable for graduate students in courses on commutative algebra, algebraic combinatorics, and statistics. Additionally, researchers interested in any of these areas but familiar with only the basic facts of commutative algebra will find it to be a valuable resource.

The connective constant of a quasi-transitive infinite graph is a measure for the asymptotic growth rate of the number of self-avoiding walks of length n from a given starting vertex. On edge-labelled graphs the formal language of self-avoiding walks is generated by a formal grammar, which can be used to calculate the connective constant of the graph. Christian Lindorfer discusses the methods in some examples, including the infinite ladder-graph and the sandwich of two regular infinite trees.

This book constitutes the refereed proceedings of the 19th International Workshop on Combinatorial Image Analysis, IWCIA 2018, held in Porto, Portugal, in November 2018. The 18 revised full papers presented were carefully reviewed and selected from 32 submissions. The papers are grouped into two sections. The first one includes nine papers devoted to theoretical foundations of combinatorial image analysis, including digital geometry and topology, array grammars, tilings and patterns, discrete geometry in non-rectangular grids, and other technical tools for image analysis. The second part includes nine papers presenting application-driven research on topics such as discrete tomography, image segmentation, texture analysis, and medical imaging.

This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas. The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuth algorithm and a method for proving Polya's enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties. Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.

This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups. This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

This book consists of contributions from experts, presenting a fruitful interplay between different approaches to discrete geometry. Most of the chapters were collected at the conference "Geometry and Symmetry" in Veszprem, Hungary from 29 June to 3 July 2015. The conference was dedicated to Karoly Bezdek and Egon Schulte on the occasion of their 60th birthdays, acknowledging their highly regarded contributions in these fields. While the classical problems of discrete geometry have a strong connection to geometric analysis, coding theory, symmetry groups, and number theory, their connection to combinatorics and optimization has become of particular importance. The last decades have seen a revival of interest in discrete geometric structures and their symmetry. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory and geometry, combinatorial group theory, and hyperbolic geometry and topology. This book contains papers on new developments in these areas, including convex and abstract polytopes and their recent generalizations, tiling and packing, zonotopes, isoperimetric inequalities, and on the geometric and combinatorial aspects of linear optimization. The book is a valuable resource for researchers, both junior and senior, in the field of discrete geometry, combinatorics, or discrete optimization. Graduate students find state-of-the-art surveys and an open problem collection.

This volume examines mathematics as a product of the human mind and analyzes the language of "pure mathematics" from various advanced-level sources. Through analysis of the foundational texts of mathematics, it is demonstrated that math is a complex literary creation, containing objects, actors, actions, projection, prediction, planning, explanation, evaluation, roles, image schemas, metonymy, conceptual blending, and, of course, (natural) language. The book follows the narrative of mathematics in a typical order of presentation for a standard university-level algebra course, beginning with analysis of set theory and mappings and continuing along a path of increasing complexity. At each stage, primary concepts, axioms, definitions, and proofs will be examined in an effort to unfold the tell-tale traces of the basic human cognitive patterns of story and conceptual blending. This book will be of interest to mathematicians, teachers of mathematics, cognitive scientists, cognitive linguists, and anyone interested in the engaging question of how mathematics works and why it works so well.

Contributions in this volume focus on computationally efficient algorithms and rigorous mathematical theories for analyzing large-scale networks. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. This proceeding is a result of the 7th International Conference in Network Analysis, held at the Higher School of Economics, Nizhny Novgorod in June 2017. The conference brought together scientists, engineers, and researchers from academia, industry, and government.