High speed computation of group characters

DOI10.1007/BF02162877MaRDI QIDQ2529984zbMATH OpenFDO

Authors John D. Dixon

Publication date 1967

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131802

zbMATH Keywords

group theory

Cited in

(18)

• Computing character degrees in p-groups
• Calculating characters of \(p\)-groups
• Irreducible representations of finite 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
• On the characters of solvable finite groups
• Optimal factor group for nonsymmorphic space groups
• Computing Irreducible Representations of Groups
• Reduction of Group Representations. V
• Finite groups
• Class number relations from a computational point of view
• Local symmetry groups for arbitrary wavevectors
• Row–column duality and combinatorial topological strings
• Computing with groups and their character tables
• Dixon's character table algorithm revisited

This page was built for publication: High speed computation of group characters

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