Computing Irreducible Representations of Finite Groups

DOI10.2307/2008443MaRDI QIDQ4712164zbMATH OpenOpenAlexFDO

Authors László Babai, Lajos Rónyai

Publication date 25 June 1992

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

zbMATH Keywords

bit-complexityfinite groupgeneratorsirreducible representationsmultiplication tablepolynomial-time algorithm

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Symbolic computation and algebraic computation (68W30)

Recommendations

• An algorithm for constructing representations of finite groups.
• scientific article; zbMATH DE number 3884354
• Computing irreducible representations of supersolvable groups over small finite fields
• Splitting permutation representations of finite groups by polynomial algebra methods

Cited in

(39)

• Tilted irreducible representations of the permutation group
• Constructing irreducible representations of discrete groups
• Double coset decompositions and computational harmonic analysis on groups
• Splitting permutation representations of finite groups by polynomial algebra methods
• The computer construction of matrix representations of finite groups over finite fields
• Extensions of irreducible representations
• Computational bounds for doing harmonic analysis on permutation modules of finite groups
• A note on the Hambleton-Taylor-Williams conjecture
• Integrality, duality and finiteness in combinatoric topological strings
• Finding the dimension of a non-empty orthogonal array polytope
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
• An algorithm for decomposing representations of finite groups using invariant projections
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• An algorithm for constructing representations of finite groups.
• Writing representations over proper division subrings.
• Minimizing representations over number fields.
• Counting equivalence classes of irreducible representations
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• Computing irreducible representations of supersolvable groups over small finite fields
• Quasirandom Groups
• A general method to calculate all irreducible representations of a finite group
• scientific article; zbMATH DE number 4073283 (Why is no real title available?)
• scientific article; zbMATH DE number 1263306 (Why is no real title available?)
• Calculs d'invariants primitifs de groupes finis
• scientific article; zbMATH DE number 475366 (Why is no real title available?)
• Writing representations over minimal fields
• Splitting full matrix algebras over algebraic number fields.
• The Computational Complexity to Evaluate Representations of General Linear Groups
• scientific article; zbMATH DE number 6913614 (Why is no real title available?)
• RepLAB: a computational/numerical approach to representation theory
• scientific article; zbMATH DE number 7559443 (Why is no real title available?)
• Determinant Equivalence Test over Finite Fields and over Q
• Representations and characters of Salingaros' vee groups of low order
• Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
• Decomposition of algebras over finite fields and number fields
• Fast generalized DFTs for all finite groups
• Minimizing representations over number fields. II: Computations in the Brauer group.
• Computational complexity of immanents and representations of the full linear group
• Symmetry in semidefinite programs

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

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