This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open questions and suggestions for further reading.

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.

Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson-Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom-Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson-Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists, quantum field theorists, and probabilists, including graduate and advanced undergraduate students.

Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of algebraic combinatorics. After recalling basic notions of combinatorics, representation theory, and some commutative algebra, the main material provides links between the study of coinvariant or diagonally coinvariant spaces and the study of Macdonald polynomials and related operators. This gives rise to a large number of combinatorial questions relating to objects counted by familiar numbers such as the factorials, Catalan numbers, and the number of Cayley trees or parking functions. The author offers ideas for extending the theory to other families of finite Coxeter groups, besides permutation groups.

This book provides the basis of a formal language and explores its possibilities in the characterization of multiplex networks. Armed with the formalism developed, the authors define structural metrics for multiplex networks. A methodology to generalize monoplex structural metrics to multiplex networks is also presented so that the reader will be able to generalize other metrics of interest in a systematic way. Therefore, this book will serve as a guide for the theoretical development of new multiplex metrics. Furthermore, this Brief describes the spectral properties of these networks in relation to concepts from algebraic graph theory and the theory of matrix polynomials. The text is rounded off by analyzing the different structural transitions present in multiplex systems as well as by a brief overview of some representative dynamical processes. Multiplex Networks will appeal to students, researchers, and professionals within the fields of network science, graph theory, and data science.

This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors' favorite conjectures and open problems, enhancing the reader's overall comprehension and enthusiasm. The editors were inspired to create these volumes by the popular and well attended special sessions, entitled "My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In an effort to aid in the creation and dissemination of open problems, which is crucial to the growth and development of a field, the editors requested the speakers, as well as notable experts in graph theory, to contribute to these volumes.

This book concentrates on the modern theory of dynamical systems and its interactions with number theory and combinatorics. The greater part begins with a course in analytic number theory and focuses on its links with ergodic theory, presenting an exhaustive account of recent research on Sarnak's conjecture on Moebius disjointness. Selected topics involving more traditional connections between number theory and dynamics are also presented, including equidistribution, homogenous dynamics, and Lagrange and Markov spectra. In addition, some dynamical and number theoretical aspects of aperiodic order, some algebraic systems, and a recent development concerning tame systems are described.

This text is intended for an honors calculus course or for an introduction to analysis. Involving rigorous analysis, computational dexterity, and a breadth of applications, it is ideal for undergraduate majors. This third edition includes corrections as well as some additional material. Some features of the text include: The text is completely self-contained and starts with the real number axioms; The integral is defined as the area under the graph, while the area is defined for every subset of the plane; There is a heavy emphasis on computational problems, from the high-school quadratic formula to the formula for the derivative of the zeta function at zero; There are applications from many parts of analysis, e.g., convexity, the Cantor set, continued fractions, the AGM, the theta and zeta functions, transcendental numbers, the Bessel and gamma functions, and many more; Traditionally transcendentally presented material, such as infinite products, the Bernoulli series, and the zeta functional equation, is developed over the reals; and There are 385 problems with all the solutions at the back of the text.

Outer billiards provides a toy model for planetary motion and exhibits intricate and mysterious behavior even for seemingly simple examples. It is a dynamical system in which a particle in the plane moves around the outside of a convex shape according to a scheme that is reminiscent of ordinary billiards. The Plaid Model, which is a self-contained sequel to Richard Schwartz's Outer Billiards on Kites, provides a combinatorial model for orbits of outer billiards on kites. Schwartz relates these orbits to such topics as polytope exchange transformations, renormalization, continued fractions, corner percolation, and the Truchet tile system. The combinatorial model, called "the plaid model," has a self-similar structure that blends geometry and elementary number theory. The results were discovered through computer experimentation and it seems that the conclusions would be extremely difficult to reach through traditional mathematics. The book includes an extensive computer program that allows readers to explore the materials interactively and each theorem is accompanied by a computer demonstration.

This book is the second edition of the third and last volume of a treatise on projective spaces over a finite field, also known as Galois geometries. This volume completes the trilogy comprised of plane case (first volume) and three dimensions (second volume). This revised edition includes much updating and new material. It is a mostly self-contained study of classical varieties over a finite field, related incidence structures and particular point sets in finite n-dimensional projective spaces. General Galois Geometries is suitable for PhD students and researchers in combinatorics and geometry. The separate chapters can be used for courses at postgraduate level.

This proceedings volume gathers selected, revised papers presented at the 51st Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2020), held at Florida Atlantic University in Boca Raton, USA, on March 9-13, 2020. The SEICCGTC is broadly considered to be a trendsetter for other conferences around the world - many of the ideas and themes first discussed at it have subsequently been explored at other conferences and symposia. The conference has been held annually since 1970, in Baton Rouge, Louisiana and Boca Raton, Florida. Over the years, it has grown to become the major annual conference in its fields, and plays a major role in disseminating results and in fostering collaborative work. This volume is intended for the community of pure and applied mathematicians, in academia, industry and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactions among these fields.

This image-rich book explores the practice as well as the theory of visual representation and presents us with the importance of designing appropriate images for communication to specific target audiences. This includes the appropriate choice of high-tech digital or low-tech analogue technologies in image-making for communication within the medical education, biological research and community health contexts. We hear from medical students about the value of using clay modelling in their understanding of anatomy, from educators and curriculum designers about visual affordances in medical education and from a community-driven project in South Africa about their innovative use of locally designed images and culture-specific narratives for communicating important health information to marginalised communities. A chapter explores the evolution of scientific visualisation and representation of big data to a variety of audiences, and another presents the innovative 3D construction of internal cellular structures from microscopic 2D slices. As we embrace blended learning in anatomy education, a timely chapter prompts us to think further about and contribute to the ongoing discourse around important ethical considerations in the use and sharing of digital images of body donors. This book will appeal to educators, medical illustrators, curriculum designers, post-graduate students, community health practitioners and biomedical researchers.

This book constitutes the refereed proceedings of the 11th International Conference on Combinatorics on Words, WORDS 2017, held in Montreal, QC, Canada, in September 2017. The 21 revised full papers presented together with 5invoted talks were carefully reviewed and selected from 26 submissions. Discrete geometry plays an expanding role in the fields of shape modeling, image synthesis, and image analysis. It deals with topological and geometrical definitions of digitized objects or digitized images and provides both a theoretical and computational framework for computer imaging.

Advanced Graph Theory focuses on some of the main notions arising in graph theory with an emphasis from the very start of the book on the possible applications of the theory and the fruitful links existing with linear algebra. The second part of the book covers basic material related to linear recurrence relations with application to counting and the asymptotic estimate of the rate of growth of a sequence satisfying a recurrence relation.

This book presents a novel non-intrusive infrastructure monitoring technique based on the detection and tracking of scattering centers in spaceborne SAR images. The methodology essentially consists of refocusing each available SAR image on an imposed 3D point cloud associated to the envisaged infrastructure element and identifying the reliable scatterers to be monitored by means of four dimensional (4D) tomography. The methodology described in this book provides a new perspective on infrastructure monitoring with spaceborne SAR images, is based on a standalone processing chain, and brings innovative technical aspects relative to conventional approaches. The book is intended primarily for professionals and researchers working in the area of critical infrastructure monitoring by radar remote sensing.

This book is divided into two parts, the first of which seeks to connect the phase transitions of various disciplines, including game theory, and to explore the synergies between statistical physics and combinatorics. Phase Transitions has been an active multidisciplinary field of research, bringing together physicists, computer scientists and mathematicians. The main research theme explores how atomic agents that act locally and microscopically lead to discontinuous macroscopic changes. Adopting this perspective has proven to be especially useful in studying the evolution of random and usually complex or large combinatorial objects (like networks or logic formulas) with respect to discontinuous changes in global parameters like connectivity, satisfiability etc. There is, of course, an obvious strategic element in the formation of a transition: the atomic agents "selfishly" seek to optimize a local parameter. However, up to now this game-theoretic aspect of abrupt, locally triggered changes had not been extensively studied. In turn, the book's second part is devoted to mathematical and computational methods applied to the pricing of financial contracts and the measurement of financial risks. The tools and techniques used to tackle these problems cover a wide spectrum of fields, like stochastic calculus, numerical analysis, partial differential equations, statistics and econometrics. Quantitative Finance is a highly active field of research and is increasingly attracting the interest of academics and practitioners alike. The material presented addresses a wide variety of new challenges for this audience.

The canonical way to establish the central limit theorem for i.i.d. random variables is to use characteristic functions and Levy's continuity theorem. This monograph focuses on this characteristic function approach and presents a renormalization theory called mod- convergence. This type of convergence is a relatively new concept with many deep ramifications, and has not previously been published in a single accessible volume. The authors construct an extremely flexible framework using this concept in order to study limit theorems and large deviations for a number of probabilistic models related to classical probability, combinatorics, non-commutative random variables, as well as geometric and number-theoretical objects. Intended for researchers in probability theory, the text is carefully well-written and well-structured, containing a great amount of detail and interesting examples.

This textbook provides an introduction to the Catalan numbers and their remarkable properties, along with their various applications in combinatorics. Intended to be accessible to students new to the subject, the book begins with more elementary topics before progressing to more mathematically sophisticated topics. Each chapter focuses on a specific combinatorial object counted by these numbers, including paths, trees, tilings of a staircase, null sums in Zn+1, interval structures, partitions, permutations, semiorders, and more. Exercises are included at the end of book, along with hints and solutions, to help students obtain a better grasp of the material. The text is ideal for undergraduate students studying combinatorics, but will also appeal to anyone with a mathematical background who has an interest in learning about the Catalan numbers. "Roman does an admirable job of providing an introduction to Catalan numbers of a different nature from the previous ones. He has made an excellent choice of topics in order to convey the flavor of Catalan combinatorics. [Readers] will acquire a good feeling for why so many mathematicians are enthralled by the remarkable ubiquity and elegance of Catalan numbers." - From the foreword by Richard Stanley

This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device. The topics include a friendly invitation to Ehrhart's theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler-Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more. With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume? Reviews of the first edition: "You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics." - MAA Reviews "The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate rial, exercises, open problems and an extensive bibliography." - Zentralblatt MATH "This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron." - Mathematical Reviews "Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course." - CHOICE

This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.

This new edition to the classic book by ggplot2 creator Hadley Wickham highlights compatibility with knitr and RStudio. ggplot2 is a data visualization package for R that helps users create data graphics, including those that are multi-layered, with ease. With ggplot2, it's easy to: produce handsome, publication-quality plots with automatic legends created from the plot specification superimpose multiple layers (points, lines, maps, tiles, box plots) from different data sources with automatically adjusted common scales add customizable smoothers that use powerful modeling capabilities of R, such as loess, linear models, generalized additive models, and robust regression save any ggplot2 plot (or part thereof) for later modification or reuse create custom themes that capture in-house or journal style requirements and that can easily be applied to multiple plots approach a graph from a visual perspective, thinking about how each component of the data is represented on the final plot This book will be useful to everyone who has struggled with displaying data in an informative and attractive way. Some basic knowledge of R is necessary (e.g., importing data into R). ggplot2 is a mini-language specifically tailored for producing graphics, and you'll learn everything you need in the book. After reading this book you'll be able to produce graphics customized precisely for your problems, and you'll find it easy to get graphics out of your head and on to the screen or page.

This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liege, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Conference on Trusted Systems, INTRUST 2015, held in Beijing, China, in December 2015. The revised 12 full papers presented have been carefully reviewed and selected from 29 submissions. They are devoted to all aspects of trusted computing systems, including trusted modules, platforms; networks, services and applications. The papers are organized in the following sections: encryptions and signatures; security model; trusted technologies; software and system security.

This book offers an overview of traditional big visual data analysis approaches and provides state-of-the-art solutions for several scene comprehension problems, indoor/outdoor classification, outdoor scene classification, and outdoor scene layout estimation. It is illustrated with numerous natural and synthetic color images, and extensive statistical analysis is provided to help readers visualize big visual data distribution and the associated problems. Although there has been some research on big visual data analysis, little work has been published on big image data distribution analysis using the modern statistical approach described in this book. By presenting a complete methodology on big visual data analysis with three illustrative scene comprehension problems, it provides a generic framework that can be applied to other big visual data analysis tasks.

This book constitutes the thoroughly refereed post-workshop proceedings for the 26 International Workshop on combinatorial Algorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefully reviewed and selected from a total of 90 submissions. The topics of the papers include algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms), algorithms on strings and graphs; applications (bioinformatics, music analysis, networking, and others); combinatorics on words; combinatorial enumeration; combinatorial optimization; complexity theory; computational biology; compression and information retrieval; cryptography and information security; decompositions and combinatorial designs; discrete and computational geometry; graph drawing and labeling; graph theory.