Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325744 | Journal of Symbolic Computation | 2005 | 18 Pages |
Abstract
We shall describe an algorithm for computing an irreducible matrix representation R which affords a given character Ï of a given group G. The algorithm uses properties of the structure of G which can be computed efficiently by a program such as GAP, theoretical results from representation theory, theorems from group theory (including the classification of finite simple groups), and linear algebra. All results in this paper have been implemented in the GAPÂ package REPSN.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Vahid Dabbaghian-Abdoly,