Computing character degrees in p-groups (Q1073174): Difference between revisions

Let G be a finite p-group and let d(G) denote the sequence \(\{c_ i\}\) where G has \(c_ i\) irreducible characters of degree \(p^ i\). The aim of this paper is to describe an efficient way to compute this sequence. Let N be any central cyclic subgroup of G, and \(\lambda\) be a faithful irreducible character of N. Then the induced character \(\lambda^ G\) is independent of the choice of \(\lambda\), so we can define \(d(G,N)=\{d_ i\}\) where G has \(d_ i\) distinct irreducible characters of degree \(p^ i\) appearing in \(\lambda^ G\). The author now gives a recursive algorithm for computing d(G,N), and shows that in the special case where Z is a central subgroup of order p, then \(d(G)=d(G/Z)+(p-1)d(G,Z)\). Applying these results, and using the computer group theory language CAYLEY developed by John Cannon, the author has successfully computed the sequences d(G) for groups G of order up to \(p^{15}\) for small primes p.