The complexity of the equivalence and equation solvability problems over meta-abelian groups (Q2343499)

For a finite group \(G\), the author considers two (dual) algorithmic problems: {\parindent=0.6cm \begin{itemize}\item[--] \textit{the equation solvability problem}: for a given equation \(w(x,y,\dots)=1\) (where \(w\) is an element of the free product \(G*F(x,y\dots)\) of \(G\) and the free group), determine whether or not this equation has a solution in \(G\); \item[--] \textit{the equivalence problem}: for a given inequation \(w(x,y,\dots)\neq1\), (where \(w\) is an element of the free product \(G*F(x,y\dots)\) of \(G\) and the free group), determine whether or not this inequation has a solution in \(G\). \end{itemize}} The author proves that, if \(G\) is a semidirect product \(G=AB\) of a normal abelian subgroup \(A\) and a subgroup~\(B\) such that the quotient group \(G/C(A)\) is abelian (where \(C(A)\) is the centraliser of \(A\) in \(G\)) and the equivalence problem is polynomially solvable in \(B\), then the equivalence problem is polynomial solvable in \(G\). This sharpens some early known results. For the equation solvability problems in semidirect products \(G=AB\) of abelian groups, the author obtains a more technical theorem stated in terms of the subring \(R\) of the endomorphism ring of \(A\) generated by the automorphisms induced by the actions of \(B\). For instance, if \(R\) is direct indecomposible or the multiplicative group of \(R\) is cyclic, then the equation solvability problem in~\(G\) is polynomial solvable.