COMPUTATION IN WORD-HYPERBOLIC GROUPS

DOI10.1142/S0218196701000619MaRDI QIDQ4786291zbMATHOpenAlexFDO

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)

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

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)

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.

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

Cites work

• Strongly geodesically automatic groups are hyperbolic

Cited in

(18)

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

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)