High speed computation of group characters
From MaRDI portal
Publication:2529984
DOI10.1007/BF02162877zbMath0166.29001MaRDI QIDQ2529984
Publication date: 1967
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131802
Related Items
Computing Irreducible Representations of Groups, Reduction of Group Representations. V, Class number relations from a computational point of view, Finite groups, Computing with groups and their character tables, Dixon's character table algorithm revisited, 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
Cites Work