COMPUTATION IN WORD-HYPERBOLIC GROUPS

DOI10.1142/S0218196701000619zbMath1024.20039arXivmath/9811012OpenAlexW1992028397MaRDI QIDQ4786291

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) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Hyperbolic groups and nonpositively curved groups (20F67) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

Geometric algorithms for discreteness and faithfulness, The Development of the Theory of Automatic Groups, Stallings graphs for quasi-convex subgroups, GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE, Polynomial-time proofs that groups are hyperbolic, Orbit decidability and the conjugacy problem for some extensions of groups, Exponentially generic subsets of groups, Detecting conjugacy stability of subgroups in certain classes of groups, THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS, Quadratic equations in hyperbolic groups are NP-complete

Cites Work

• Strongly geodesically automatic groups are hyperbolic