Computing with endomorphism rings of modular representations (Q915851)

The representation theory has benefited greatly from computational methods and the benefit may even increase in the next future when dealing with more and more complicated examples. So, this paper which presents new algorithms for computing invariants in modular representation theory may be very appreciated. It presents algorithms to compute the endomorphism ring of a module, vertex and source, the socle series, to test indecomposability, to construct complements. In particular, the computation of the endomorphism ring required ingenious ideas since the limits of the current hardware capabilities are reached easily, even in small dimensions. The methods are then applied to the simple groups \(M_{22}\), \(M_{23}\), \(M_{24}\) and \(J_ 2.\) The algorithms are implemented in the CAYLEY system.