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. © 2006 Elsevier Ltd. All rights reserved.
Previtali, A. (2006). Irreducible constituents of monomial representations. JOURNAL OF SYMBOLIC COMPUTATION, 41(12), 1345-1359 [10.1016/j.jsc.2006.09.002].
Irreducible constituents of monomial representations
PREVITALI, ANDREA
2006
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. © 2006 Elsevier Ltd. All rights reserved.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
