This book complements the authors’ monograph Cellular Automata and Groups [CAG] (Springer Monographs in Mathematics). It consists of more than 600 fully solved exercises in symbolic dynamics and geometric group theory with connections to geometry and topology, ring and module theory, automata theory and theoretical computer science. Each solution is detailed and entirely self-contained, in the sense that it only requires a standard undergraduate-level background in abstract algebra and general topology, together with results established in [CAG] and in previous exercises. It includes a wealth of gradually worked out examples and counterexamples presented here for the first time in textbook form. Additional comments provide some historical and bibliographical information, including an account of related recent developments and suggestions for further reading. The eight-chapter division from [CAG] is maintained. Each chapter begins with a summary of the main definitions and results contained in the corresponding chapter of [CAG]. The book is suitable either for classroom or individual use. Foreword by Rostislav I. Grigorchuk

This unique book provides a self-contained exposition of the theory of cellular automata on groups and explores its deep connections with recent developments in geometric and combinatorial group theory, amenability, symbolic dynamics, the algebraic theory of group rings, and other branches of mathematics and theoretical computer science. The topics treated include the Garden of Eden theorem for amenable groups, the Gromov–Weiss surjunctivity theorem, and the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. Entirely self-contained and now in its second edition, the volume includes 10 appendices and more than 600 exercises, the solutions of which are presented in the companion book Exercises in Cellular Automata and Groups (2023) by the same authors. It will appeal to a large audience, including specialists and newcomers to the field.

The series is aimed specifically at publishing peer reviewed reviews and contributions presented at workshops and conferences. Each volume is associated with a particular conference, symposium or workshop. These events cover various topics within pure and applied mathematics and provide up-to-date coverage of new developments, methods and applications.

This reference discusses how automata and language theory can be used to understand solutions to solving equations in groups and word problems in groups. Examples presented include, how Fine scale complexity theory has entered group theory via these connections and how cellular automata, has been generalized into a group theoretic setting. Chapters written by experts in group theory and computer science explain these connections.

Cellular automata provide an interesting avenue into the study of complex systems in general, as well as having an intrinsic interest of their own. Because of their mathematical simplicity and representational robustness they have been used to model economic, political, biological, ecological, chemical, and physical systems. Almost any system which can be treated in terms of a discrete representation space in which the dynamics is based on local interaction rules can be modelled by a cellular automata. The aim of this book is to give an introduction to the analysis of cellular automata (CA) in terms of an approach in which CA rules are viewed as elements of a nonlinear operator algebra, which can be expressed in component form much as ordinary vectors are in vector algebra. Although a variety of different topics are covered, this viewpoint provides the underlying theme. The actual mathematics used is not complicated, and the material should be accessible to anyone with a junior-level university background, and a certain degree of mathematical maturity.

Consumption takes place in settings or environments which have both direct and indirect effects on its dynamic path. Direct effects of environments on activities in consuming can occur through constraints that environments impose. Environment can also have indirect effects on consumption through enduring modification of internalized constructs which enter heuristics for decisions on activities. The importance of environments to consumption is increased by the definitional dependence of status on the judgements of others. This study examines microprocessing in consumer activities for status as it interacts with structure in the environments of these activities. The importance of environments in status activities provides the basis for a seperate, but related inquiry into observed differences in the form they take across societies. Conjecture on the consequences of differences in the structure of environments for consumption that typify a society is studied in the narrative statements by members of comparison societies and in the content of print advertising in these societies. Evolutionary processes which could establish observed differences in structure across societies are also considered in both their systematic and random components. I review models of random drift and stochastic resonance as candidate forms for generating observed structure in environments. Directions for the subsequent study of status through consumption are discussed.P Introduction: Status Through Consumption; Knowledge Use in Nonwork Activities for Status; Interactions of Consumer Microprocessing and Structured Environments: Activity Feedback and the Stability of Structure; Awards and Honors Systems in Structured Environments: Cross Societal Comparisons of Narrative Statements on Consuming for Status; Comparative Analyses of Consumption Appeals in the Print Advertising of the USA and France, 1955-1991 Random Process in the Generation of Structured Environments; Overview and directions for Study of Status Through Consumption.

Covering the major topics of evolutionary game theory, Game-Theoretical Models in Biology, Second Edition presents both abstract and practical mathematical models of real biological situations. It discusses the static aspects of game theory in a mathematically rigorous way that is appealing to mathematicians. In addition, the authors explore many applications of game theory to biology, making the text useful to biologists as well. The book describes a wide range of topics in evolutionary games, including matrix games, replicator dynamics, the hawk-dove game, and the prisoner’s dilemma. It covers the evolutionarily stable strategy, a key concept in biological games, and offers in-depth details of the mathematical models. Most chapters illustrate how to use Python to solve various games. Important biological phenomena, such as the sex ratio of so many species being close to a half, the evolution of cooperative behaviour, and the existence of adornments (for example, the peacock’s tail), have been explained using ideas underpinned by game theoretical modelling. Suitable for readers studying and working at the interface of mathematics and the life sciences, this book shows how evolutionary game theory is used in the modelling of these diverse biological phenomena. In this thoroughly revised new edition, the authors have added three new chapters on the evolution of structured populations, biological signalling games, and a topical new chapter on evolutionary models of cancer. There are also new sections on games with time constraints that convert simple games to potentially complex nonlinear ones; new models on extortion strategies for the Iterated Prisoner’s Dilemma and on social dilemmas; and on evolutionary models of vaccination, a timely section given the current Covid pandemic. Features Presents a wide range of biological applications of game theory. Suitable for researchers and professionals in mathematical biology and the life sciences, and as a text for postgraduate courses in mathematical biology. Provides numerous examples, exercises, and Python code.

This textbook offers a rigorous mathematical introduction to cellular automata (CA). Numerous colorful graphics illustrate the many intriguing phenomena, inviting undergraduates to step into the rich field of symbolic dynamics. Beginning with a brief history, the first half of the book establishes the mathematical foundations of cellular automata. After recapping the essentials from advanced calculus, the chapters that follow introduce symbolic spaces, equicontinuity, and attractors. More advanced topics include the Garden of Eden theorem and Conway's Game of Life, and a chapter on stochastic CA showcases a model of virus spread. Exercises and labs end each chapter, covering a range of applications, both mathematical and physical. Designed for undergraduates studying mathematics and related areas, the text provides ample opportunities for end-of-semester projects or further study. Computer use for the labs is largely optional, providing flexibility for different preferences and resources. Knowledge of advanced calculus and linear algebra is essential, while a course in real analysis would be ideal.

This volume constitutes the thoroughly refereed proceedings of the 23rd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2017, held in Milan, Italy, in June 2017. The 14 full papers presented together with one full-length invited paper and 2 invited talk abstracts were carefully reviewed and selected from a total of 28 submissions. The papers feature research on correlated models of automata. The topics include aspects and features of such models: dynamics; topological, ergodic, and algebraic aspects; algorithmic and complexity issues; emergent properties; formal languages; symbolic dynamics; tilings; models of parallelism and distributed systems; timing schemes; synchronous versus asynchronous models; phenomenological descriptions; scientific modelling; practical applications.

Nearly one hundred years ago Jacques Hadamard used infinite sequences of symbols to analyze the distribution of geodesics on certain surfaces. That was the beginning of symbolic dynamics. In the 1930's and 40's Arnold Hedlund and Marston Morse again used infinite sequences to investigate geodesics on surfaces of negative curvature. They coined the term symbolic dynamics and began to study sequence spaces with the shift transformation as dynamical systems. In the 1940's Claude Shannon used sequence spaces to describe infor mation channels. Since that time symbolic dynamics has been used in ergodic theory, topological dynamics, hyperbolic dynamics, information theory and complex dynamics. Symbolic dynamical systems with a finite memory are stud ied in this book. They are the topological Markov shifts. Each can be defined by transition rules and the rules can be summarized by a transition matrix. The study naturally divides into two parts. The first part is about topological Markov shifts where the alphabet is finite. The second part is concerned with topological Markov shifts whose alphabet is count ably infinite. The techniques used in the two cases are quite different. When the alphabet is finite most of the methods are combinatorial or algebraic. When the alphabet is infinite the methods are much more analytic. This book grew from notes for a graduate course taught at Wesleyan Uni versity in the fall of 1994 and is intended as a graduate text and as a reference book for mathematicians working in related fields.