The Conjugacy Problem for Recursively Presented Virtually Soluble Groups of Finite Prüfer Rank

We solve a long-standing conjugacy problem for finitely presented soluble groups of finite Prüfer rank, recorded as Problem~9.52 in the Kourovka Notebook, in the stronger setting of recursively presented finitely generated virtually soluble groups. Robinson proved that, in every recursively presented finitely generated virtually soluble minimax group, conjugacy to any fixed element is decidable, while explicitly lefting open whether the procedure could be made uniform in the target element. We establish this uniformity. More specifically, we prove that every recursively presented finitely generated virtually soluble group of finite Prüfer rank has decidable Conjugacy Problem.