Geometric and Computational Perspectives on Infinite Groups
About this Title
Gilbert Baumslag, City College (CUNY), New York, NY, David B A Epstein, University of Warwick, Coventry, England, Robert Gilman, Stevens Institute of Technology, Hoboken, NJ, Hamish B Short, Universite de Victor Hugo, Marseille, France and Charles C Sims, Rutgers University, New Brunswick, NJ, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year: 1996; Volume 25
ISBNs: 978-0-8218-0449-0 (print); 978-1-4704-3983-5 (online)
MathSciNet review: MR1364175
MSC: Primary 20F32; Secondary 20-06
This book contains the proceedings of two workshops on computational aspects of geometric group theory. The workshops, held in the winter of 1994 at DIMACS and at the Geometry Center, covered practical group theoretic computation and theoretical problems.
Containing both research and expository articles, this book is the only one available concentrating on the computational aspects of geometric group theory. Because this area involves an interplay between group theory, geometry, and automata theory, the expository articles in this book should help researchers in these fields to make connections to the other areas.
Mathematicians and computer scientists.
Table of Contents
- Lower bounds of isoperimetric functions for nilpotent groups
- A filtration of the chain complex of a rewriting system
- Formal languages and infinite groups
- Groups of deficiency zero
- The Warwick automatic groups software
- Some remarks on one-relator free products with amalgamation
- Detecting quasiconvexity: Algorithmic aspects
- A user’s guide to the mapping class group: Once punctured surfaces
- Computing nilpotent quotients of finitely presented groups
- An algorithm detecting hyperbolicity
- On the finite subgroups of a context-free group