Isomorphism problem for finitely generated fully residually free groups

2005/02/23 by Inna Bumagin, Bumagin, Inna, Olga Kharlampovich +3
Mathematics · #20E36 #20F65 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20E36 #msc:20F65

paper · pdf · doi:10.48550/arxiv.math/0502496

26 pages

arxiv created 2005/02/23 · arxiv updated 2009/12/01

Abstract

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free 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).

Related

• On isomorphisms to a free group and beyond
• Unsolvability of the isomorphism problem for [free abelian]-by-free groups
• Finitely presented residually free groups
• Profinite completions of free-by-free groups contain everything
• Subgroup Conjugacy Separability in Residually Free Groups