Calculating characters of p-groups

Authors:
S. B. Conlon
Affiliations:
-
Venue:
Journal of Symbolic Computation
Year:
1990

Citing 3
Cited 4

Computing character degrees in p-groups

Journal of Symbolic Computation
Dixon's character table algorithm revisited

Journal of Symbolic Computation
An algorithm for the computation of conjugacy classes and centralizes in p-groups

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

Computing modular and projective character degrees of soluble groups

Journal of Symbolic Computation
Computing character tables of p-groups

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra

Journal of Symbolic Computation
Cited References

Computer algebra handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

A central problem in computational group theory is that of getting the table of ordinary characters for a finite group. The current technique (due to Dixon and Schneider) is based on an old idea of Burnside and takes no account of any special properties which the group may have. Over the last few years a number of very poverful techniques have been developed for computing with p-groups defined by a power-commutator presentation. In this paper a character table algorithm for such groups is presented. A trial implementation of this new algorithm indicates its superiority over the generalDixon-Schneider algorithm for p-groups having order greater than p^1^2.