The conjugacy and isomorphism problems for combable groups.

DOI10.1007/S00208-003-0453-6MaRDI QIDQ1416722zbMATH OpenOpenAlexFDO

Authors Martin R. Bridson

Publication date 16 December 2003

Published in Mathematische Annalen (Search for Journal in Brave)

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

zbMATH Keywords

conjugacy problemisomorphism problemnegative curvaturehyperbolic groupscombable groupssemihyperbolic groups

Mathematics Subject Classification ID

Geometric group theory (20F65) Hyperbolic groups and nonpositively curved groups (20F67) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Recommendations

• scientific article; zbMATH DE number 18966
• The conjugacy problem for knot groups
• The conjugacy problem in automaton groups is not solvable.
• The isomorphism problem for residually torsion-free nilpotent groups.
• Isomorphism versus commensurability for a class of finitely presented groups.

Cited in

(9)

• The conjugacy problem in automaton groups is not solvable.
• A NOTE ON THE GRAMMAR OF COMBINGS
• On the Conjugacy Problem for Cyclic Extensions of Free Groups
• The Word Problem Versus the Isomorphism Problem
• Algorithmic problems in groups with quadratic Dehn function
• On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups.
• The isomorphism problem for residually torsion-free nilpotent groups.
• scientific article; zbMATH DE number 18966 (Why is no real title available?)
• Isomorphism versus commensurability for a class of finitely presented groups.

This page was built for publication: The conjugacy and isomorphism problems for combable groups.

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