The word problem for geometrically finite groups

DOI10.1007/BF00164400zbMath0595.20032MaRDI QIDQ1077540

A. Howard M. Hoare, Roger C. Lyndon, William J. Floyd

Publication date: 1986

Published in: Geometriae Dedicata (Search for Journal in Brave)

zbMATH Keywords

presentationwordsgroup of isometriesword problemgeometrically finiteTodd-Coxeter algorithmDirichlet regionf-decidablehyperbolic d-spacehyperbolic or euclidean space

Mathematics Subject Classification ID

Hyperbolic and elliptic geometries (general) and generalizations (51M10) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Euclidean geometries (general) and generalizations (51M05)

Related Items (1)

FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY

Cites Work

• The combinatorial structure of cocompact discrete hyperbolic groups
• Group completions and limit sets of Kleinian groups
• Unnamed Item
• Unnamed Item

This page was built for publication: The word problem for geometrically finite groups