The origins of the word problem are in group theory, decidability and complexity. But through the vision of M. Gromov and the language of filling functions, the topic now impacts the world of large-scale geometry. This book contains accounts of many recent developments in Geometric Group Theory and shows the interaction between the word problem and geometry continues to be a central theme. It contains many figures, numerous exercises and open questions.
Self-similar groups (groups generated by automata) initially appeared as examples of groups that are easy to define but have exotic properties like nontrivial torsion, intermediate growth, etc. This book studies the self-similarity phenomenon in group theory and shows its intimate relationship with dynamical systems and more classical self-similar structures, such as fractals, Julia sets, and self-affine tilings. This connection is established through the central topics of the book, which are the notions of the iterated monodromy group and limit space. A wide variety of examples and different applications of self-similar groups to dynamical systems and vice versa are discussed. In particular, it is shown that Julia sets can be reconstructed from the respective iterated monodromy groups and that groups with exotic properties can appear not just as isolated examples, but as naturally defined iterated monodromy groups of rational functions. The book offers important, new mathematics that will open new avenues of research in group theory and dynamical systems. It is intended to be accessible to a wide readership of professional mathematicians.
Geometric group theory is the study of the interplay between groups and the spaces they act on, and has its roots in the works of Henri Poincaré, Felix Klein, J.H.C. Whitehead, and Max Dehn. Office Hours with a Geometric Group Theorist brings together leading experts who provide one-on-one instruction on key topics in this exciting and relatively new field of mathematics. It's like having office hours with your most trusted math professors. An essential primer for undergraduates making the leap to graduate work, the book begins with free groups—actions of free groups on trees, algorithmic questions about free groups, the ping-pong lemma, and automorphisms of free groups. It goes on to cover several large-scale geometric invariants of groups, including quasi-isometry groups, Dehn functions, Gromov hyperbolicity, and asymptotic dimension. It also delves into important examples of groups, such as Coxeter groups, Thompson's groups, right-angled Artin groups, lamplighter groups, mapping class groups, and braid groups. The tone is conversational throughout, and the instruction is driven by examples. Accessible to students who have taken a first course in abstract algebra, Office Hours with a Geometric Group Theorist also features numerous exercises and in-depth projects designed to engage readers and provide jumping-off points for research projects.
In this the authors obtain an isoperimetric characterization of relatively hyperbolicity of a groups with respect to a collection of subgroups. This allows them to apply classical combinatorial methods related to van Kampen diagrams to obtain relative analogues of some well-known algebraic and geometric properties of ordinary hyperbolic groups. There is also an introduction and study of the notion of a relatively quasi-convex subgroup of a relatively hyperbolic group and solve somenatural algorithmic problems.
This volume presents an array of topics that introduce the reader to key ideas in active areas in geometry and topology. The material is presented in a way that both graduate students and researchers should find accessible and enticing. The topics covered range from Morse theory and complex geometry theory to geometric group theory, and are accompanied by exercises that are designed to deepen the reader's understanding and to guide them in exciting directions for future investigation.
Examines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups can be used in public key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory.
The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent results on the compressed word problem to create a cohesive self-contained book accessible to computer scientists as well as mathematicians. Readers will quickly reach the frontier of current research which makes the book especially appealing for students looking for a currently active research topic at the intersection of group theory and computer science. The word problem introduced in 1910 by Max Dehn is one of the most important decision problems in group theory. For many groups, highly efficient algorithms for the word problem exist. In recent years, a new technique based on data compression for providing more efficient algorithms for word problems, has been developed, by representing long words over group generators in a compressed form using a straight-line program. Algorithmic techniques used for manipulating compressed words has shown that the compressed word problem can be solved in polynomial time for a large class of groups such as free groups, graph groups and nilpotent groups. These results have important implications for algorithmic questions related to automorphism groups.
Since the pioneering works of Novikov and Maltsev, group theory has been a testing ground for mathematical logic in its many manifestations, from the theory of algorithms to model theory. The interaction between logic and group theory led to many prominent results which enriched both disciplines. This volume reflects the major themes of the American Mathematical Society/Association for Symbolic Logic Joint Special Session (Baltimore, MD), Interactions between Logic, Group Theory and Computer Science. Included are papers devoted to the development of techniques used for the interaction of group theory and logic. It is suitable for graduate students and researchers interested in algorithmic and combinatorial group theory. A complement to this work is Volume 349 in the AMS series, Contemporary Mathematics, Computational and Experimental Group Theory, which arose from the same meeting and concentrates on the interaction of group theory and computer science.
