Decidable Properties of Polycyclic Groups

From MaRDI portal





The paper gives an algorithm for deciding whether or not two polycyclic- by-finite (PF) groups, given by finite presentations, are isomorphic, thus showing that the isomorphism problem for the class of PF groups is solvable. This is an application of the following more general algorithm: given a PF group G, subgroups \(A_ 1,...,A_ n,B_ 1,...,B_ n\) of G, and elements \(a_ 1,...,a_ m\), \(b_ 1,...,b_ m\) of G, it decides whether or not there exists an automorphism \(\alpha\) of G such that \(A_ i^{\alpha}=B_ i\) and \(a_ j^{\alpha}=b_ j\) for all i and j. Another application of this algorithm shows that if G is a PF group, then Aut(G) has solvable conjugacy problem. The method used is similar to the plan laid out in Chapters 7 and 8 of the author's book [Polycyclic Groups (Cambridge, 1983; Zbl 0516.20001)]: the problem is reduced to one about conjugacy of subgroups in an arithmetic group, and this in turn is reduced to an ``orbit problem of the kind dealt with by \textit{F. J. Grunewald} and \textit{D. Segal} [Ann. Math., II. Ser. 112, 531-583 (1980; Zbl 0457.20047)]. Other results proved include the ``local-global property for conjugacy of finite sets of subgroups and elements in a PF group; this yields as a consequence the solvability of a ``generalized conjugacy problem in PF groups. Finally, two undecidability theorems are established. (1) There exist a finitely generated torsion-free nilpotent group G and a subgroup A of G such that the question of whether an arbitrary element of G is conjugate to some element of A is algorithmically undecidable. (2) There exist G and A as in (1) such that the question of whether an arbitrary element of G can be mapped into A by some automorphisms of G is algorithmically undecidable. Both of these results are shown to be equivalent to the negative solution of Hilbert's 10th problem.




Cited in
(25)








This page was built for publication: Decidable Properties of Polycyclic Groups

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