Algorithms for twisted conjugacy classes of polycyclic-by-finite groups. II (Q7294302)

Let \(G\) and \(H\) be polycyclic-by-finite groups and let \(\varphi,\psi\colon H\to G\) be homomorphisms. The action of \(H\) on \(G\) given by \(g\cdot h=\varphi(h)^{-1}g\psi(h)\) defines the \((\varphi,\psi)\)-twisted conjugacy classes, whose number is the Reidemeister number \(R(\varphi,\psi)\). The article constructs an algorithm which decides whether \(R(\varphi,\psi)\) is finite and, in the finite case, computes a set of representatives. More generally, given a normal subgroup \(N\) of \(G\), the algorithm determines the number of twisted conjugacy classes meeting \(N\) and produces representatives lying in \(N\).\N\NThis continues the work of \textit{K.~Dekimpe} and \textit{S.~Tertooy} [Topol. Appl. 293, Article ID 107565, 12 p. (2021; Zbl 1535.20004)], where the case \(G=H\) was treated. The construction combines twisted-conjugacy separability with recursive reductions through normal subgroups and algorithms for nilpotent-by-finite, metabelian and nilpotent-by-abelian groups.\N\NAs applications, algorithms are obtained for double-coset membership and search, for computing double-coset indices and representatives, and for determining stabilizers and orbits of affine actions. Further consequences concern kernels, images and preimages of derivations and the decision of their surjectivity. The algorithms for polycyclic groups are implemented in the GAP package \texttt{TwistedConjugacy}.