The conjugacy and isomorphism problems for combable groups
Martin R. Bridson
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.
Create a lesson
Related papers
On the maximum relational complexity of affine groups
Coen del Valle, Nick Gill, Pablo Spiga
Maximal subgroups of topological full groups of shifts of finite type
Hiroki Matui
Prefixes of Coxeter elements are Coxeter elements of the reflection subgroups they generate
Patrick Wegener
Invariable Generation of Groups of Homeomorphisms
Neelam, Davide Perego, Matteo Tarocchi
Conformal dimension and self-similar groups
Volodymyr Nekrashevych
An analog of Quillen-Venkov for eventually negligible classes and radicality for finite irreducible Coxeter groups
Constantin Cedillo Vayson de Pradenne, Matthew Gherman, Enoch Guo et al.