Algorithmic recognition of infinite cyclic extensions

From MaRDI portal
Publication:2396795




Abstract: We prove that one cannot algorithmically decide whether a finitely presented mathbbZ-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the equivalence between the isomorphism problem within the subclass of unique mathbbZ-extensions, and the semi-conjugacy problem for deranged outer automorphisms.



Cites work







This page was built for publication: Algorithmic recognition of infinite cyclic extensions

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