Complexity of Spherical Equations in Finite Groups

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups G. We classify the complexity of different variations of the problem, e.g., when G is fixed and when G is a part of the input. When the group G is constant or given as multiplication table, we show that the problem can always be solved in polynomial time. On the other hand, for the permutation groups \(S_n\) (with n part of the input), the problem is \(\textsf{NP}\) -complete. The situation for matrix groups is quite involved: while we exhibit sequences of 2-by-2 matrices where the problem is \(\textsf{NP}\) -complete, in the full group \({\text {GL}}(2,p)\) (p prime and part of the input) it can be solved in polynomial time. We also find a similar behaviour with subgroups of matrices of arbitrary dimension over a constant ring.