Algorithms for twisted conjugacy classes of polycyclic-by-finite groups
From MaRDI portal
Publication:6335151
DOI10.1016/J.TOPOL.2020.107565arXiv2002.08285MaRDI QIDQ6335151FDOQ6335151
Authors: Karel Dekimpe, Sam Tertooy 
Publication date: 19 February 2020
Abstract: We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that the Reidemeister coincidence number of these endomorphisms is finite. The second algorithm determines representatives of the Reidemeister coincidence classes of two endomorphisms if their Reidemeister coincidence number is finite, or returns "fail" if the Reidemeister coincidence number is infinite.
Conjugacy classes for groups (20E45) Generalizations of solvable and nilpotent groups (20F19) Fixed points and coincidences in algebraic topology (55M20) Computational methods for problems pertaining to group theory (20-08)
This page was built for publication: Algorithms for twisted conjugacy classes of polycyclic-by-finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6335151)
