Abstract
AbstractWe describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the groups of compact 3-manifolds based on six of Thurston’s eight geometries can be proved automatic. We describe software developed in Warwick to compute automatic structures, as well as the development of practical algorithms that use those structures. We explain how actions of groups on spaces displaying various notions of negative curvature can be used to prove automaticity or biautomaticity, and show how these results have been used to derive these properties for groups in some infinite families (braid groups, mapping class groups, families of Artin groups, and Coxeter groups). Throughout the text we flag up open problems as well as problems that remained open for some time but have now been resolved.KeywordsAutomatic groupHyperbolic groupFinite state automatonCombing3-manifold groupDecision problemWord problemConjugacy problemArtin groupCoxeter groupMapping class groupAMS Subject Classifications20F1020F3620F5520F6520F6757M60; Secondary Classification: 03D1068Q04
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
