Computing irreducible representations of supersolvable groups

Abstract

Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time O ( n 2 log ⁡ n ) O({n^2}\log n) . We present an improved algorithm with running time O ( n log ⁡ n ) O(n\log n) .