Dixon's character table algorithm revisited

DOI10.1016/S0747-7171(08)80077-6zbMath0701.20002MaRDI QIDQ913946

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 group; ordinary characters; modified algorithm; running time; CAYLEY; Burnside group; class matrices; Mathieu group \(M(22)\)

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20C15: Ordinary representations and characters

20-04: Software, source code, etc. for problems pertaining to group theory

20C34: Representations of sporadic groups

Related Items

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, Class number relations from a computational point of view, Row–column duality and combinatorial topological strings, 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., Combinatoric topological string theories and group theory algorithms, The Alperin Weight Conjecture and Dade's Conjecture for the Simple Group Fi′₂₄

Uses Software

• Cayley
• CAS

Cites Work

• Computing character degrees in p-groups
• High speed computation of group characters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item