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

finite groupmodified algorithmrunning timeordinary charactersCAYLEYBurnside groupclass matricesMathieu group \(M(22)\)

Mathematics Subject Classification ID

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

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

• 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?)
• Computing character degrees in p-groups
• High speed computation of group characters

Cited in

(15)

• Computing characters of groups with central subgroups.
• Class number relations from a computational point of view
• Calculating characters of \(p\)-groups
• Construction of the irreducible modular representations of a finite group
• Irreducible constituents of monomial representations.
• 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^*
• The Alperin Weight Conjecture and Dade's Conjecture for the Simple Group Fi′₂₄
• RepLAB: a computational/numerical approach to representation theory
• Computing with characters of finite groups
• Reliability and reproducibility of Atlas information
• Combinatoric topological string theories and group theory algorithms
• Integrality, duality and finiteness in combinatoric topological strings
• Computing the character table of a finite group.
• Row–column duality and combinatorial topological strings

Describes a project that uses

Uses Software

• CAS
• Cayley

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)