↓ Skip to main content
What is this page? Embed badge

Algorithms and Classification in Combinatorial Group Theory

Overview of attention for book
Cover of 'Algorithms and Classification in Combinatorial Group Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Decision Problems for Groups — Survey and Reflections
  3. Altmetric Badge
    Chapter 2 The Word Problem for Solvable Groups and Lie Algebras
  4. Altmetric Badge
    Chapter 3 Solution of the Conjugacy Problem in One-Relator Groups
  5. Altmetric Badge
    Chapter 4 A Tour Around Finitely Presented Infinite Simple Groups
  6. Altmetric Badge
    Chapter 5 The Geometry of Finitely Presented Infinite Simple Groups
  7. Altmetric Badge
    Chapter 6 The Geometry of Rewriting Systems: A Proof of the Anick-Groves-Squier Theorem
  8. Altmetric Badge
    Chapter 7 Combings of Groups
  9. Altmetric Badge
    Chapter 8 Automatic Groups and Amalgams — A Survey
  10. Altmetric Badge
    Chapter 9 Dehn Functions and l 1 -norms of Finite Presentations
  11. Altmetric Badge
    Chapter 10 Problems on Automatic Groups
Attention for Chapter 4: A Tour Around Finitely Presented Infinite Simple Groups
Altmetric Badge
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Tour Around Finitely Presented Infinite Simple Groups
Chapter number 4
Book title
Algorithms and Classification in Combinatorial Group Theory
Published by
Springer, New York, NY, January 1992
DOI 10.1007/978-1-4613-9730-4_4
Book ISBNs
978-1-4613-9732-8, 978-1-4613-9730-4
Authors

E. A. Scott

View on publisher site

This page is provided by Altmetric.