Finding the radical of an algebra of linear transformations


We present a method that reduces the problem of computing the radical of a matrix algebra over an arbitrary field to solving systems of semilinear equations. The complexity of the algorithm, measured in the number of arithmetic operations and the total number of the coefficients passed to an oracle for solving semilinear equations, is polynomial. As an application of the technique we present a simple test for isomorphism of semisimple modules. @ 1997 Elsevier Science B.V. 1991 Muth. Subj. Class.: 16N20, 16P10, 68420

Cite this paper

@inproceedings{Cohen2003FindingTR, title={Finding the radical of an algebra of linear transformations}, author={Arjeh M. Cohen and David B. Wales}, year={2003} }