Article ID Journal Published Year Pages File Type
5772857 Journal of Pure and Applied Algebra 2017 25 Pages PDF
Abstract
We prove that one cannot algorithmically decide whether a finitely presented Z-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 Z-extensions, and the semi-conjugacy problem for deranged outer automorphisms.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Authors
, , , ,