Decision problems and profinite completions of groups
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not $P$ is isomorphic to $\...
| Autor principal: | |
|---|---|
| Formato: | Journal article |
| Lenguaje: | English |
| Publicado: |
2008
|