Computation in word-hyperbolic groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
23 pages, 7 figures, 2 tables

Keywords

Group Theory, Geometric Topology, 20F32 (primary); 20F10 (secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/77649

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9811012
 http://arxiv.org/abs/math/9811012

Collections

arXiv