Enumerating limit groups
| dc.creator | Groves, Daniel | |
| dc.creator | Wilton, Henry | |
| dc.date | 2007-04-09 | |
| dc.date | 2007-05-22 | |
| dc.date.accessioned | 2026-07-07T08:02:27Z | |
| dc.date.available | 2026-07-07T08:02:27Z | |
| dc.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. | |
| dc.description | 14 pages; added recognition algorithms for free groups and surface groups | |
| dc.identifier | https://arxiv.org/abs/0704.0989 | |
| dc.identifier | http://arxiv.org/abs/0704.0989 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/129233 | |
| dc.subject | Group Theory | |
| dc.subject | 20F10; 20F65 | |
| dc.title | Enumerating limit groups | |
| dc.type | text |