Dixon's character table algorithm revisited

DOI10.1016/S0747-7171(08)80077-6zbMath0701.20002OpenAlexW1967540202MaRDI 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 groupordinary charactersmodified algorithmrunning timeCAYLEYBurnside groupclass matricesMathieu group \(M(22)\)

Mathematics Subject Classification ID

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

Related Items

The 5-modular characters of the sporadic simple rudvalis group and its covering group^*, Row–column duality and combinatorial topological strings, Combinatoric topological string theories and group theory algorithms, Reliability and reproducibility of Atlas information, Computing the character table of a finite group., Irreducible constituents of monomial representations., Class number relations from a computational point of view, Construction of the irreducible modular representations of a finite group, Calculating characters of \(p\)-groups, The Alperin Weight Conjecture and Dade's Conjecture for the Simple Group Fi′₂₄, Integrality, duality and finiteness in combinatoric topological strings, RepLAB: A Computational/Numerical Approach to Representation Theory

Uses Software

• Cayley
• CAS

Cites Work

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