The conjugacy and isomorphism problems for combable groups
classification
🧮 math.GR
math.GT
keywords
combablegroupsconjugacyisomorphismproblemunsolvablecertainexist
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.