The conjugacy and isomorphism problems for combable groups.
From MaRDI portal
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.
The author proves the following two results, which answer important open questions: Theorem A. There exist combable groups in which the conjugacy problem is unsolvable. Theorem B. The isomorphism problem is unsolvable in the class of combable groups.
Recommendations
Cited in
(9)- The conjugacy problem in automaton groups is not solvable.
- The isomorphism problem for residually torsion-free nilpotent groups.
- Algorithmic problems in groups with quadratic Dehn function
- Isomorphism versus commensurability for a class of finitely presented groups.
- The Word Problem Versus the Isomorphism Problem
- scientific article; zbMATH DE number 18966 (Why is no real title available?)
- A NOTE ON THE GRAMMAR OF COMBINGS
- On the Conjugacy Problem for Cyclic Extensions of Free Groups
- On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic 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)