Computation with Finitely Presented Groups PDF Download

Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Computation with Finitely Presented Groups PDF full book. Access full book title Computation with Finitely Presented Groups by Charles C. Sims. Download full books in PDF and EPUB format.

Computation with Finitely Presented Groups

Computation with Finitely Presented Groups PDF Author: Charles C. Sims
Publisher: Cambridge University Press
ISBN: 0521432138
Category : Mathematics
Languages : en
Pages : 624

Book Description
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.

Computation with Finitely Presented Groups

Computation with Finitely Presented Groups PDF Author: Charles C. Sims
Publisher: Cambridge University Press
ISBN: 0521432138
Category : Mathematics
Languages : en
Pages : 624

Book Description
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.

The Geometry of the Word Problem for Finitely Generated Groups

The Geometry of the Word Problem for Finitely Generated Groups PDF Author: Noel Brady
Publisher: Springer Science & Business Media
ISBN: 3764379502
Category : Mathematics
Languages : en
Pages : 206

Book Description
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.

Finitely Presented Groups

Finitely Presented Groups PDF Author: Volker Diekert
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3111473570
Category : Mathematics
Languages : en
Pages : 252

Book Description
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.

Self-Similar Groups

Self-Similar Groups PDF Author: Volodymyr Nekrashevych
Publisher: American Mathematical Soc.
ISBN: 0821838318
Category : Mathematics
Languages : en
Pages : 248

Book Description
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.

Presentations of Groups

Presentations of Groups PDF Author: D. L. Johnson
Publisher: Cambridge University Press
ISBN: 9780521585422
Category : Mathematics
Languages : en
Pages : 228

Book Description
The aim of this book is to provide an introduction to combinatorial group theory. Any reader who has completed first courses in linear algebra, group theory and ring theory will find this book accessible. The emphasis is on computational techniques but rigorous proofs of all theorems are supplied.This new edition has been revised throughout, including new exercises and an additional chapter on proving that certain groups are infinite.

Cellular Automata and Groups

Cellular Automata and Groups PDF Author: Tullio Ceccherini-Silberstein
Publisher: Springer Science & Business Media
ISBN: 3642140343
Category : Computers
Languages : en
Pages : 446

Book Description
Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form.

Finitely Presented Infinite Simple Groups

Finitely Presented Infinite Simple Groups PDF Author: Graham Higman
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 96

Book Description


Varieties of Representations of Finitely Generated Groups

Varieties of Representations of Finitely Generated Groups PDF Author: Alexander Lubotzky
Publisher: American Mathematical Soc.
ISBN: 082182337X
Category : Mathematics
Languages : en
Pages : 134

Book Description
The n-dimensional representations, over an algebraically closed characteristic zero field k, of a finitely generated group are parameterized by an affine algebraic variety over k. The tangent spaces of this variety are subspaces of spaces of one-cocycles and thus the geometry of the variety is locally related to the cohomology of the group. The cohomology is also related to the prounipotent radical of the proalgebraic hull of the group. This paper exploits these two relations to compute dimensions of representation varieties, especially for nilpotent groups and their generalizations. It also presents the foundations of the theory of representation varieties in an expository, self-contained manner.

Topics in Groups and Geometry

Topics in Groups and Geometry PDF Author: Tullio Ceccherini-Silberstein
Publisher: Springer Nature
ISBN: 3030881091
Category : Mathematics
Languages : en
Pages : 468

Book Description
This book provides a detailed exposition of a wide range of topics in geometric group theory, inspired by Gromov’s pivotal work in the 1980s. It includes classical theorems on nilpotent groups and solvable groups, a fundamental study of the growth of groups, a detailed look at asymptotic cones, and a discussion of related subjects including filters and ultrafilters, dimension theory, hyperbolic geometry, amenability, the Burnside problem, and random walks on groups. The results are unified under the common theme of Gromov’s theorem, namely that finitely generated groups of polynomial growth are virtually nilpotent. This beautiful result gave birth to a fascinating new area of research which is still active today. The purpose of the book is to collect these naturally related results together in one place, most of which are scattered throughout the literature, some of them appearing here in book form for the first time. In this way, the connections between these topics are revealed, providing a pleasant introduction to geometric group theory based on ideas surrounding Gromov's theorem. The book will be of interest to mature undergraduate and graduate students in mathematics who are familiar with basic group theory and topology, and who wish to learn more about geometric, analytic, and probabilistic aspects of infinite groups.

$SL(2)$ Representations of Finitely Presented Groups

$SL(2)$ Representations of Finitely Presented Groups PDF Author: Gregory W. Brumfiel
Publisher: American Mathematical Soc.
ISBN: 0821804162
Category : Mathematics
Languages : en
Pages : 208

Book Description
This book is essentially self-contained and requires only a basic abstract algebra course as background. The book includes and extends much of the classical theory of SL(2) representations of groups. Readers will find SL(2) Representations of Finitely Presented Groups relevant to geometric theory of three dimensional manifolds, representations of infinite groups, and invariant theory. Features...... * A new finitely computable invariant H[*p] associated to groups and used to study the SL(2) representations of *p * Invariant theory and knot theory related through SL(2) representations of knot groups.