Computation in word-hyperbolic groups

Simple item page
dc.creatorEpstein, David B. A.
dc.creatorHolt, Derek F.
dc.date1998-11-03
dc.date.accessioned2026-07-07T05:26:42Z
dc.date.available2026-07-07T05:26:42Z
dc.descriptionWe 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.
dc.description23 pages, 7 figures, 2 tables
dc.identifierhttps://arxiv.org/abs/math/9811012
dc.identifierhttp://arxiv.org/abs/math/9811012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77649
dc.subjectGroup Theory
dc.subjectGeometric Topology
dc.subject20F32 (primary); 20F10 (secondary)
dc.titleComputation in word-hyperbolic groups
dc.typetext

Files

Collections

arXiv