Computing matrix representations

DOI10.1090/S0025-5718-10-02330-6zbMath1196.20018OpenAlexW2028838204MaRDI QIDQ3584851

Vahid Dabbaghian, John D. Dixon

Publication date: 30 August 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-10-02330-6

zbMATH Keywords

algorithmsfinite groupsfaithful irreducible characterscomputing matrix representations

Mathematics Subject Classification ID

Ordinary representations and characters (20C15)

Related Items (3)

Splitting fields of real irreducible representations of finite groups ⋮ Equations of Riemann surfaces with automorphisms ⋮ Construction of the irreducible modular representations of a finite group

Uses Software

• GAP
• REPSN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A direct proof of Minkwitz's extension theorem
• Extensions of irreducible representations
• An algorithm for constructing representations of finite groups.
• Constructing representations of higher degrees of finite simple groups and covers

This page was built for publication: Computing matrix representations