Computation in word-hyperbolic groups
Group Theory
2007-05-23 v1 Geometric Topology
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.
Cite
@article{arxiv.math/9811012,
title = {Computation in word-hyperbolic groups},
author = {David B. A. Epstein and Derek F. Holt},
journal= {arXiv preprint arXiv:math/9811012},
year = {2007}
}
Comments
23 pages, 7 figures, 2 tables