Abstract
Character tables of finite groups are an important tool in Representation Theory and are particularly important also for applications. The character table of a finite group (in this paper this will always mean the table of irreducible characters over C, in contrast to Brauer-character tables to be discussed later) contains a wealth of information on the group usually in a relatively compact form. The latter is true in particular for simple groups; even for large groups where it is completely out of the question to compute with elements or even store them in a computer, the character table might still be easily manageable. For instance the Monster group (also called Fischer Griess group or ”friendly giant”) has about 1054 elements but its character table is just a 194 × 194 matrix. To make full use of the information encoded in the character table it is usually necessary to perform calculations which for larger examples one certainly would not like to do without the help of a computer. So it is certainly useful to have character tables not only in book form but also stored on a computer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O. Bonten, Clifford-Matrizen, Diplomarbeit Aachen 1988
J. H. Conway, Character Calisthenics; in: Computational Group Theory (ed. M. D. Atkinson) pp. 249–266, London: Academic Press 1984
B. Fischer, Clifford Matrizen, manuscript 1982
B. Fischer, unpublished manuscript 1985
D. F. Holt, W. Plesken, Perfect Groups. Oxford: Clarendon Press 1989
I. M. Isaacs, Character Theory of Finite Groups. New York: Academic Press 1976
A. K. Lenstra, H. W. Lenstra, L. Lovasz, Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 513–534.
B. H. Matzat, Konstruktive Galoistheorie. (Lecture Notes in Mathematics 1284) Springer 1987, x + 286 pp
B. H. Matzat, Über das Umkehrproblem der Galoischen Theorie. J. ber. d. Dt. Math. Verein. 90 (1988), 155–183
J. Neubüser, H. Pahlings, W. Plesken, CAS; design and use of a system for the handling of characters of finite groups, in: Computational Group Theory (ed. M. D. Atkinson) pp 195–247, London: Academic Press 1984
H. Pahlings, Realizing finite groups as Galois groups. To appear
H. Pahlings, W. Plesken, Group actions on Cartesian powers with applications to representation theory. J. reine angew. Math., 380 (1987), 178–195
M. Pohst, A modification of the LLL reduction algorithm, J. Symbolic Computation 4 (1987), 123–127
C. Seidler, der LLL-Algorithmus und seine Implementation in CAS. Diplomarbeit, Aachen 1988
J.-P. Serre, Groupes de Galois sur Q. Séminaire Bourbaki no. 689, 1987-88, Astérisque 161–162, (1988), 73–85
M. Zumbroich, Grundlagen einer Arithmetik in Kreisteilungskörpern und deren Implementation in CAS. Diplomarbeit, Aachen 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pahlings, H. (1990). Computing with characters of finite groups. In: Cattaneo, G.M.P., Strickland, E. (eds) Topics in Computational Algebra. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3424-8_2
Download citation
DOI: https://doi.org/10.1007/978-94-011-3424-8_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5514-7
Online ISBN: 978-94-011-3424-8
eBook Packages: Springer Book Archive