The isomorphism problem for finitely generated fully residually free groups.

From MaRDI portal



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).


A group \(G\) is called fully residually free if for any finite number of nontrivial elements \(g_1,\dots,g_n\in G\) there is a homomorphism \(\varphi\colon G\to F\) from \(G\) to a free group \(F\) that maps \(g_1,\dots,g_n\) to nontrivial elements \(g_1^\varphi,\dots,g_n^\varphi\in F\). The main result states that there exists an algorithm that for any two finite presentations of fully residually free groups answers whether these groups are isomorphic or not. Moreover, if these presentations define isomorphic groups the algorithm finds an isomorphism. Also, a structure theorem for the group of outer automorphisms \(\text{Out}(G)\) of any finitely generated fully residually free group \(G\) is obtained.



Cites work


Cited in
(28)








This page was built for publication: The isomorphism problem for finitely generated fully residually free groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860430)