Enumerating limit groups.

From MaRDI portal
Publication:838396

DOI10.4171/GGD/63zbMATH Open1216.20029arXiv0704.0989MaRDI QIDQ838396FDOQ838396


Authors: Daniel Groves, Henry Wilton Edit this on Wikidata


Publication date: 25 August 2009

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0704.0989




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Enumerating limit groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838396)