Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on April 16, 2008
Bulletin of the London Mathematical Society 2008 40(3):395-404; doi:10.1112/blms/bdn018
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
40/3/395    most recent
bdn018v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dahmani, F.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

Finding relative hyperbolic structures

François Dahmani

Institut de Mathématiques de Toulouse
Université Paul Sabatier
F-31062 Toulouse cedex 9
France

Received 22 September 2006. Revision received 13 July 2007.

We propose an algorithm that recognizes relatively hyperbolic groups from a compatible relative presentation, and even from an arbitrary finite presentation when the parabolic subgroups are abelian. Moreover, it computes important characteristic features such as the hyperbolicity constant of the coned-off Cayley graph. This tool allows us to unify solutions to decision problems for individual groups in the class of relatively hyperbolic groups with abelian parabolics, into a unique solution suitable for every group in the class.

2000 Mathematics Subject Classification 20F67 (primary), 20F10 (secondary).

Partially supported by the ANR (ANR-06-JCJC-0099)


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.