Algorithmic recognition of infinite cyclic extensions

From MaRDI portal
Publication:2396795

DOI10.1016/J.JPAA.2016.10.008zbMATH Open1403.20047arXiv1509.05879OpenAlexW2963296215MaRDI QIDQ2396795FDOQ2396795

Enric Ventura Capell, Jordi Delgado, Bren Cavallo, Delaram Kahrobaei

Publication date: 26 May 2017

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1509.05879




Recommendations



Cites Work


Cited In (4)





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)