The complexity of the equivalence and equation solvability problems over meta-Abelian groups

We provide polynomial time algorithms for deciding equation solvability and identity checking over groups that are semidirect products of two finite Abelian groups. Our main method is to reduce these problems to the sigma equation solvability and sigma equivalence problems over modules for commutative unital rings.