Computing modular and projective character degrees of soluble groups (Q810140)

The article is about a finite soluble group G, a central cyclic subgroup Z, the quotient \(H=G/Z\), an algebraically closed field F of characteristic r, where r is a rational prime or zero. With these ingredients, the goal is the set of degrees of irreducible characters of the group algebra of G over F. The solution is given in terms of an algorithm, based, as one might expect, on the repeated application of Clifford theory. The algorithm has been implemented in the CAYLEY language. A large number of results for specific groups are given.