论文标题
串联串联划分的算法划分的划分类别的算法
Algorithms for twisted conjugacy classes of polycyclic-by-finite groups
论文作者
论文摘要
我们构建了两种实用算法，用于划分划分的划分类别的共轭类。第一种算法确定了两个给定内态的两个元素是否是扭曲的共轭，这是在这些内态的reidemister数字是有限的。第二种算法确定了如果雷德氏骨的巧合数是有限的，则确定了两个内态的Reidemeister巧合类别的代表，或者如果reidemeister的巧合数是无限的，则返回“失败”。
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.
