Computing Representations of Higher Degrees of Finite Groups
Vahid Dabbaghian-Abdoly, Department of Computer Science, University of Calgary
Abstract: There is an algorithm for constructing representations of finite groups affording characters of degrees less than 32. This restriction only appears at the level where recursion has to deal with a perfect group. In this talk I describe this restriction and I will discuss on the extending the algorithm to higher degrees (for example, degrees less than 100). This will require dealing with perfect groups of two main types. The first is the case when G is a simple group or a covering group of a simple group and the second one is when G is a perfect group such that the socle of G/Z(G) is abelian.