This book contains surveys and research articles on the state-of-the-art in finitely presented groups for researchers and graduate students. Overviews of current trends in exponential groups and of the classification of finite triangle groups and finite generalized tetrahedron groups are complemented by new results on a conjecture of Rosenberger and an approximation theorem. A special emphasis is on algorithmic techniques and their complexity, both for finitely generated groups and for finite Z-algebras, including explicit computer calculations highlighting important classical methods. A further chapter surveys connections to mathematical logic, in particular to universal theories of various classes of groups, and contains new results on countable elementary free groups. Applications to cryptography include overviews of techniques based on representations of p-groups and of non-commutative group actions. Further applications of finitely generated groups to topology and artificial intelligence complete the volume. All in all, leading experts provide up-to-date overviews and current trends in combinatorial group theory and its connections to cryptography and other areas.

Presents the current state of knowledge in all aspects of two-dimensional homotopy theory. Useful for both students and experts.

This book consists of a selection of articles devoted to new ideas and developments in low dimensional topology. Low dimensions refer to dimensions three and four for the topology of manifolds and their submanifolds. Thus we have papers related to both manifolds and to knotted submanifolds of dimension one in three (classical knot theory) and two in four (surfaces in four dimensional spaces). Some of the work involves virtual knot theory where the knots are abstractions of classical knots but can be represented by knots embedded in surfaces. This leads both to new interactions with classical topology and to new interactions with essential combinatorics.

This book gives an advanced overview of several topics in infinite group theory. It can also be considered as a rigorous introduction to combinatorial and geometric group theory. The philosophy of the book is to describe the interaction between these two important parts of infinite group theory. In this line of thought, several theorems are proved multiple times with different methods either purely combinatorial or purely geometric while others are shown by a combination of arguments from both perspectives. The first part of the book deals with Nielsen methods and introduces the reader to results and examples that are helpful to understand the following parts. The second part focuses on covering spaces and fundamental groups, including covering space proofs of group theoretic results. The third part deals with the theory of hyperbolic groups. The subjects are illustrated and described by prominent examples and an outlook on solved and unsolved problems. New edition now includes the topics on universal free groups, quasiconvex subgroups and hyperbolic groups, and also Stallings foldings and subgroups of free groups. New results on groups of F-types are added.

The Algorithmic Number Theory Symposium (ANTS), held biennially since 1994, is the premier international forum for research in computational and algorithmic number theory. ANTS is devoted to algorithmic aspects of number theory, including elementary, algebraic, and analytic number theory, the geometry of numbers, arithmetic algebraic geometry, the theory of finite fields, and cryptography.This volume is the proceedings of the fourteenth ANTS meeting, which took place 29 June to 4 July 2020 via video conference, the plans for holding it at the University of Auckland, New Zealand, having been disrupted by the COVID-19 pandemic. The volume contains revised and edited versions of 24 refereed papers and one invited paper presented at the conference.

This volume contains the proceedings of three special sessions: Algebra and Computer Science, held during the Joint AMS-EMS-SPM meeting in Porto, Portugal, June 10–13, 2015; Groups, Algorithms, and Cryptography, held during the Joint Mathematics Meeting in San Antonio, TX, January 10–13, 2015; and Applications of Algebra to Cryptography, held during the Joint AMS-Israel Mathematical Union meeting in Tel-Aviv, Israel, June 16–19, 2014. Papers contained in this volume address a wide range of topics, from theoretical aspects of algebra, namely group theory, universal algebra and related areas, to applications in several different areas of computer science. From the computational side, the book aims to reflect the rapidly emerging area of algorithmic problems in algebra, their computational complexity and applications, including information security, constraint satisfaction problems, and decision theory. The book gives special attention to recent advances in quantum computing that highlight the need for a variety of new intractability assumptions and have resulted in a new area called group-based cryptography.