Irreducible constituents of monomial representations

• Autores: Andrea Previtali
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 41, Nº 12, 2006, págs. 1345-1359
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Abstract 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.