Algorithm determines isomorphism for finitely generated metabelian groups linked to integer polynomials, indicating a significant advancement in group theory.
In a previous work, it was shown that there is a finitely generated metabelian group of finite torsion-free rank associated with each non-constant, non-unit integer polynomial. Here an algorithm is devised which is able to decide if two such groups are isomorphic.
No takes yet. Share an insight, caveat, or question.
Derek J. S. Robinson (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
More from Journal of Group Theory