The isomorphism problem for finitely generated fully residually free groups

Inna Bumagin; Olga Kharlampovich; Alexei Miasnikov

doi:10.1016/j.jpaa.2006.03.025

The isomorphism problem for finitely generated fully residually free groups

Inna Bumagin, Olga Kharlampovich, Alexei Miasnikov

Department of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Abstract

We prove that the isomorphism problem for finitely generated fully residually free groups (or F-groups for short) is decidable. We also show that each F-group G has a decomposition that is invariant under automorphisms of G, and obtain a structure theorem for the group of outer automorphisms Out (G).

Original language	English
Pages (from-to)	961-977
Number of pages	17
Journal	Journal of Pure and Applied Algebra
Volume	208
Issue number	3
DOIs	https://doi.org/10.1016/j.jpaa.2006.03.025
State	Published - Mar 2007

Access to Document

10.1016/j.jpaa.2006.03.025

Cite this

@article{65b20225ab7744e1871cb8cfcfe67f5f,

title = "The isomorphism problem for finitely generated fully residually free groups",

abstract = "We prove that the isomorphism problem for finitely generated fully residually free groups (or F-groups for short) is decidable. We also show that each F-group G has a decomposition that is invariant under automorphisms of G, and obtain a structure theorem for the group of outer automorphisms Out (G).",

author = "Inna Bumagin and Olga Kharlampovich and Alexei Miasnikov",

year = "2007",

month = mar,

doi = "10.1016/j.jpaa.2006.03.025",

language = "English",

volume = "208",

pages = "961--977",

number = "3",

}

TY - JOUR

T1 - The isomorphism problem for finitely generated fully residually free groups

AU - Bumagin, Inna

AU - Kharlampovich, Olga

AU - Miasnikov, Alexei

PY - 2007/3

Y1 - 2007/3

N2 - We prove that the isomorphism problem for finitely generated fully residually free groups (or F-groups for short) is decidable. We also show that each F-group G has a decomposition that is invariant under automorphisms of G, and obtain a structure theorem for the group of outer automorphisms Out (G).

AB - We prove that the isomorphism problem for finitely generated fully residually free groups (or F-groups for short) is decidable. We also show that each F-group G has a decomposition that is invariant under automorphisms of G, and obtain a structure theorem for the group of outer automorphisms Out (G).

UR - https://www.scopus.com/pages/publications/33751348302

UR - https://www.scopus.com/inward/citedby.url?scp=33751348302&partnerID=8YFLogxK

U2 - 10.1016/j.jpaa.2006.03.025

DO - 10.1016/j.jpaa.2006.03.025

M3 - Article

AN - SCOPUS:33751348302

SN - 0022-4049

VL - 208

SP - 961

EP - 977

JO - Journal of Pure and Applied Algebra

JF - Journal of Pure and Applied Algebra

IS - 3

ER -

The isomorphism problem for finitely generated fully residually free groups

Abstract

Access to Document

Other files and links

Fingerprint

Cite this