vix.ing · top · new · best · stats · spec

Algorithmic Properties of Relatively Hyperbolic Groups

2003/02/20 by Donovan Yves Rebbechi, Rebbechi, Donovan Yves · 1 citation
Computer Science · Mathematics · #20F65 #Computational Geometry and Mesh Generation #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Group Theory (math.GR) #math.GR #math.GT #msc:20F65 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.math/0302245

PhD Dissertation, Rutgers Newark. 81 pages, 9 figures

arxiv created 2003/02/20 · openalex publication_date 2003/02/20 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of word hyperbolic groups are biautomatic. We prove the following generalisation: Theorem. Let H be a geometrically finite hyperbolic group. Let sigma in H2(H) and suppose that sigma restricted to P is zero for any parabolic subgroup P of H. Then the extension of H by sigma is biautomatic. We also prove another generalisation of the result of Epstein. Theorem. Let G be hyperbolic relative to H, with the bounded coset penetration property. Let H be a biautomatic group with a prefix-closed normal form. Then G is biautomatic. Based on these two results, it seems reasonable to conjecture the following (which the author believes can be proven with a simple generalisation of the argument in Section 1): Let G be hyperbolic relative to H, where H has a prefixed closed biautomatic structure. Let sigma in H2(G) and suppose that sigma restricted to H is zero. Then the extension of G by sigma is biautomatic.

Cited by

Related