Computing character tables of p-groups
Andreas Thümmel · 1996
Recently it has been shown that given a power-commutator presentation of a supersolvable group G its irreducible Crepresentations can be computedis possible to use this algorithm for the computation of a character table and a transversal of the conjugacy classes of G in time 0 (ph IG I) where h denotes the number of conjugacy classes of G.Moreover, for p >2, it is possible to compute a reduced character table which is, compared to the actual character table, compressed by a factor of (p -1)2. 1