Groups, Geometry, and Dynamics


Full-Text PDF (112 KB) | Metadata | Table of Contents | GGD summary
Volume 3, Issue 3, 2009, pp. 389–399
DOI: 10.4171/GGD/63

Published online: 2009-09-30

Enumerating limit groups

Daniel Groves[1] and Henry Wilton[2]

(1) University of Illinois at Chicago, United States
(2) University of Cambridge, Great Britain

We prove that the set of limit groups is recursively enumerable, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions ((à 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.

Keywords: Limit groups, algorithmic properties

Groves Daniel, Wilton Henry: Enumerating limit groups. Groups Geom. Dyn. 3 (2009), 389-399. doi: 10.4171/GGD/63