Computing Irreducible Representations of Groups

DOI10.2307/2004848zbMath0276.20005OpenAlexW4233477532MaRDI QIDQ4402513

John D. Dixon

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2004848

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (6)

Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups ⋮ Свертки по рангам и кватернионным типам в алгебрах Клиффорда ⋮ Local symmetry groups for arbitrary wavevectors ⋮ The virtual Haken conjecture: Experiments and examples ⋮ An algorithm for constructing representations of finite groups. ⋮ On Projective Representations of Finite Wreath Products

Cites Work

• High speed computation of group characters
• Computers in group theory
• On finite linear groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Irreducible Representations of Groups