Computing Character Degrees in p-Groups

Document Type

Article

Language

eng

Publication Date

3-1986

Publisher

Elsevier

Source Publication

Journal of Symbolic Computation

Source ISSN

0747-7171

Abstract

This paper presents a recursive procedure for computing the degrees of the irreducible complex characters of a finite p-group by working up a central series in the group. A program written in the computer group theory language CAVLE7 is presented which implements this algorithm assuming that the p-group is given in terms of a power-commutator presentation. Some times for sample runs are presented which indicate that the CAYLEY implementation is effective for groups of order up to p15 for small primes. In particular, this approach seems to produce the character degrees much faster than using CAYLEY,"S built-in character table function and reading off the degrees.

Comments

Journal of Symbolic Computation, Vol. 2, No. 1 (March 1986): 51-58. DOI.

Link to Full Text

Share

COinS