COMPUTATION IN WORD-HYPERBOLIC GROUPS

DOI10.1142/S0218196701000619zbMATH Open1024.20039arXivmath/9811012OpenAlexW1992028397MaRDI QIDQ4786291FDOQ4786291

Authors: Derek F. Holt, David B. A. Epstein 

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/9811012

Recommendations

• Efficient computation in word-hyperbolic groups
• scientific article; zbMATH DE number 4102495
• scientific article; zbMATH DE number 998573
• The isomorphism problem for hyperbolic groups. I
• Publication:4867141

zbMATH Keywords

algorithmsCayley graphsfinitely presented groupsword-hyperbolic groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Hyperbolic groups and nonpositively curved groups (20F67) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Strongly geodesically automatic groups are hyperbolic

Cited In (17)

• Stallings graphs for quasi-convex subgroups
• Polynomial-time proofs that groups are hyperbolic
• The Development of the Theory of Automatic Groups
• THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
• Title not available (Why is that?)
• Exponentially generic subsets of groups
• Real computational universality: the word problem for a class of groups with infinite presentation
• Detecting conjugacy stability of subgroups in certain classes of groups
• Geometric algorithms for discreteness and faithfulness
• Some geodesic problems in groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE
• Random van Kampen diagrams and algorithmic problems in groups.
• Orbit decidability and the conjugacy problem for some extensions of groups.
• Efficient computation in word-hyperbolic groups
• Quadratic equations in hyperbolic groups are NP-complete

This page was built for publication: COMPUTATION IN WORD-HYPERBOLIC GROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786291)