Computation in word-hyperbolic groups
David B. A. Epstein, Derek F. Holt
Abstract
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. If the group is not word-hyperbolic, the procedure continues indefinitely. We also describe a procedure which computes the thinness of geodesic triangles in the Cayley graph of a word-hyperbolic group. Again this procedure is bound to work, given sufficient memory and time.
Create a lesson
Related papers
Generation by lazy and invertible cellular automata over the Klein four-group
Edgar Alcalá-Arroyo, Alonso Castillo-Ramirez, Haobo Ma et al.
Equational theories of flat semirings S(W)
Zidong Gao, Yilin Zhou
The finite basis problem and subvariety intervals for max-plus matrix semirings
Jun Jiao, Mengya Yue
On the maximum relational complexity of affine groups
Coen del Valle, Nick Gill, Pablo Spiga
Maximal subgroups of topological full groups of shifts of finite type
Hiroki Matui
Prefixes of Coxeter elements are Coxeter elements of the reflection subgroups they generate
Patrick Wegener