arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.08285math.GRmath.AT
收藏

Algorithms for twisted conjugacy classes of polycyclic-by-finite groups

Karel Dekimpe, Sam Tertooy

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑