Isomorphism problem for finitely generated fully residually free groups

Simple item page
dc.creatorBumagin, Inna
dc.creatorKharlampovich, Olga
dc.creatorMiasnikov, Alexei
dc.date2005-02-23
dc.date.accessioned2026-07-07T05:17:25Z
dc.date.available2026-07-07T05:17:25Z
dc.descriptionWe 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).
dc.description26 pages
dc.identifierhttps://arxiv.org/abs/math/0502496
dc.identifierhttp://arxiv.org/abs/math/0502496
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74297
dc.subjectGroup Theory
dc.subject20E36; 20F65
dc.titleIsomorphism problem for finitely generated fully residually free groups
dc.typetext

Files

Collections

arXiv