Irreducible constituents of monomial representations
We describe an algorithm for obtaining the central primitive idempotents of the algebra associated with a monomial representation. As a consequence, we obtain its irreducible constituents. This is implemented in MAGMA, using an algorithm based on Dixon's modular approach. In the case of permutation representations, we get a simplified version of the algorithms of Michler and Weller. (c) 2006 Elsevier Ltd. All rights reserved.
ordinary representations and characters computational methods symbolic computation, algebraic computation