Isomorphism problem for finitely generated fully residually free groups
classification
🧮 math.GR
keywords
finitelyfreefullygeneratedresiduallyautomorphismsgroupgroups
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.