A computer algebra solution to a problem in finite groups. (Q1884040)

The author reports on an attempt to describe a sequence \(U_1,U_2,\dots\) of words in two variables such that the finite group \(G\) is soluble iff the identity \(U_n=1\) holds in \(G\) for all but finitely many \(n\). The case of the Suzuki groups is left open. For a complete result see \textit{T. Bandman}, \textit{G.-M. Greuel}, \textit{F. Grunewald}, \textit{B. Kunyavskij}, \textit{G. Pfister} and \textit{E. Plotkin} [C. R., Math., Acad. Sci. Paris 337, No. 9, 581-586 (2003; Zbl 1047.20014)].