Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
High speed computation of group characters
| |
|
High speed computation of group characters John D. Dixon1 | (1) | Department of Pure Mathematics, University of New South Wales, Box 1, P. 0., Kensington, N.S.W., Australia |
Received: 20 April 1967 Abstract This paper describes a practical procedure for computing the ordinary irreducible characters of finite groups (of orders up to 1000 or so). The novelty of the method consists of transposing the problem from the field of complex numbers into the field of integers modulo p for a suitable prime p. It is much easier to compute the modular characters in the latter field, and from these characters we can calculate the ordinary irreducible characters in algebraic form.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|