We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.
Nov 3, 1998
The purpose of this paper is to describe two algorithms for computing with word-hyperbolic groups. Both of them have been implemented in the second.
We describe two practical algorithms for computing with word-hyperbolic groups, both of which we have implemented. The first is a method for estimating the ...
There is an important class of finitely presented groups known as automatic groups, in whic hmany computations can be undertaken efficiently.
Two practical algorithms for computing with word-hyperbolic groups and the aim of the second algorithm is to compute the thinness constant for geodesic ...
We describe two practical algorithms for computing with word-hyperbolic groups, both of which we have implemented. The first is a method for estimating the ...
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is ...
Jul 1, 2000 · The word problem in a word-hyperbolic group can be solved by a Dehn algorithm in linear time. Furthermore, Epstein has shown that the conjugacy ...
Apr 15, 2014 · I'm stuck in some algorithms in hyperbolic groups, which may be rather simple. Let G be a hyperbolic group given by a finite presentation.
International Journal of Algebra and Computation | Vol 11, No 04
www.worldscientific.com › toc › ijac
We describe two practical algorithms for computing with word-hyperbolic groups, both of which we have implemented. The first is a method for estimating the ...