Dixon's character table algorithm revisited

DOI10.1016/S0747-7171(08)80077-6MaRDI QIDQ913946zbMATH OpenOpenAlexFDO

Authors Gerhard J. A. Schneider

Publication date 1990

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0747-7171(08)80077-6

zbMATH Keywords

Burnside groupCAYLEYclass matricesfinite groupMathieu group \(M(22)\)modified algorithmordinary charactersrunning time

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Ordinary representations and characters (20C15) Representations of sporadic groups (20C34) Symbolic computation and algebraic computation (68W30)

Review text

In 1967 the reviewer described an algorithm for computing the ordinary characters of a finite group from the class matrices using finite fields [\textit{J. D. Dixon}, Numer. Math. 10, 446-450 (1967; Zbl 0166.29002)], and an implementation of this algorithm has been available to users of the group theory system CAYLEY. In the present paper the author describes modifications to the algorithm which reduce the number of (expensive) computations of the class matrices. These produce dramatic improvements in the running time. The algorithm is still only useful for groups with relatively small order or with relatively few conjugacy classes. However, examples given show that the 12 characters of the Mathieu group \(M(22)\) could be computed in 563 seconds, and the 88 characters of the Burnside group \(B(2,4)\) of order \(2^{12}\) could be computed in 87 seconds. The modified algorithm is implemented in the current version of CAYLEY.

Recommendations

• Calculating characters of \(p\)-groups
• The \(p\)-group generation algorithm
• Computing the character table of a finite group.
• Computing with characters of finite groups
• scientific article; zbMATH DE number 67384

Cites work

• Computing character degrees in p-groups
• High speed computation of group characters
• scientific article; zbMATH DE number 3865540 (Why is no real title available?)
• scientific article; zbMATH DE number 3869564 (Why is no real title available?)
• scientific article; zbMATH DE number 3526920 (Why is no real title available?)
• scientific article; zbMATH DE number 3574106 (Why is no real title available?)
• scientific article; zbMATH DE number 3343017 (Why is no real title available?)

Cited in

(16)

• Calculating characters of \(p\)-groups
• Integrality, duality and finiteness in combinatoric topological strings
• Construction of the irreducible modular representations of a finite group
• Computing the character table of a finite group.
• Irreducible constituents of monomial representations.
• Computing with characters of finite groups
• Combinatoric topological string theories and group theory algorithms
• The Alperin Weight Conjecture and Dade's Conjecture for the Simple Group Fi′₂₄
• scientific article; zbMATH DE number 3869564 (Why is no real title available?)
• The 5-modular characters of the sporadic simple rudvalis group and its covering group^*
• RepLAB: a computational/numerical approach to representation theory
• Reliability and reproducibility of Atlas information
• Computing characters of groups with central subgroups.
• Class number relations from a computational point of view
• Row–column duality and combinatorial topological strings
• Arithmetic in group extensions

Describes a project that uses

Uses Software

• Cayley
• CAS

This page was built for publication: Dixon's character table algorithm revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913946)