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 (18)
On the characters of solvable finite groups ⋮ Reduction of Group Representations. V ⋮ Local symmetry groups for arbitrary wavevectors ⋮ Row–column duality and combinatorial topological strings ⋮ Combinatoric topological string theories and group theory algorithms ⋮ Dixon's character table algorithm revisited ⋮ Computing the character table of a finite group. ⋮ Irreducible constituents of monomial representations. ⋮ Class number relations from a computational point of view ⋮ Finite groups ⋮ Construction of the irreducible modular representations of a finite group ⋮ Calculating characters of \(p\)-groups ⋮ Computing with groups and their character tables ⋮ Optimal factor group for nonsymmorphic space groups ⋮ Irreducible representations of finite groups ⋮ Integrality, duality and finiteness in combinatoric topological strings ⋮ Computing Irreducible Representations of Groups ⋮ Computing character degrees in p-groups
Cites Work
This page was built for publication: High speed computation of group characters
