
Hardcover ISBN: | 978-0-8218-0449-0 |
Product Code: | DIMACS/25 |
List Price: | $84.00 |
MAA Member Price: | $75.60 |
AMS Member Price: | $67.20 |
eBook ISBN: | 978-1-4704-3983-5 |
Product Code: | DIMACS/25.E |
List Price: | $79.00 |
MAA Member Price: | $71.10 |
AMS Member Price: | $63.20 |
Hardcover ISBN: | 978-0-8218-0449-0 |
eBook: ISBN: | 978-1-4704-3983-5 |
Product Code: | DIMACS/25.B |
List Price: | $163.00 $123.50 |
MAA Member Price: | $146.70 $111.15 |
AMS Member Price: | $130.40 $98.80 |

Hardcover ISBN: | 978-0-8218-0449-0 |
Product Code: | DIMACS/25 |
List Price: | $84.00 |
MAA Member Price: | $75.60 |
AMS Member Price: | $67.20 |
eBook ISBN: | 978-1-4704-3983-5 |
Product Code: | DIMACS/25.E |
List Price: | $79.00 |
MAA Member Price: | $71.10 |
AMS Member Price: | $63.20 |
Hardcover ISBN: | 978-0-8218-0449-0 |
eBook ISBN: | 978-1-4704-3983-5 |
Product Code: | DIMACS/25.B |
List Price: | $163.00 $123.50 |
MAA Member Price: | $146.70 $111.15 |
AMS Member Price: | $130.40 $98.80 |
-
Book DetailsDIMACS - Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 25; 1996; 212 ppMSC: Primary 20; Secondary 57; 68
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.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
ReadershipMathematicians and computer scientists.
-
Table of Contents
-
Chapters
-
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
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
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.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Mathematicians and computer scientists.
-
Chapters
-
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