Enumerating limit groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore, there exists an algorithm that computes presentations for finitely generated subgroups. The other main ingredient is the ability to algorithmically calculate centralizers in relatively hyperbolic groups. Applications include the existence of recognition algorithms for limit groups and free groups.
14 pages; added recognition algorithms for free groups and surface groups

Keywords

Group Theory, 20F10; 20F65

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/129233

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0704.0989
 http://arxiv.org/abs/0704.0989

Collections

arXiv