Computing the structure of finite algebras (Q2640676): Difference between revisions

Let A be an associative algebra over \(F={\mathbb{G}}{\mathbb{F}}(q)\) with \(n=\dim_ FA<\infty\) given by an F-basis and structure constants. The author presents algorithms that solve computational problems in the algebra A in time polynomial in n and log q, namely the computation of Rad A, of the set of minimal ideals of A (if A is semisimple), and of a pair of zero divisors if there are any.