On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups
We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an algorithm that, given an arbitrary finite presentation of a...
Príomhchruthaitheoirí: | Bridson, M, Reeves, L |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
2011
|
Míreanna comhchosúla
-
The conjugacy and isomorphism problems for combable groups
de réir: Bridson, M
Foilsithe / Cruthaithe: (2002) -
Commensurating HNN-extensions: hierarchical hyperbolicity and biautomaticity
de réir: Hughes, S, et al.
Foilsithe / Cruthaithe: (2024) -
The isomorphism problem for profinite completions of residually finite groups
de réir: Bridson, M, et al.
Foilsithe / Cruthaithe: (2014) -
Profinite isomorphisms and fixed-point properties
de réir: Bridson, M
Foilsithe / Cruthaithe: (2024) -
Isomorphic spectrum and isomorphic length of a Banach space
de réir: O. Fotiy, et al.
Foilsithe / Cruthaithe: (2020-06-01)