Computing Irreducible Representations of Finite Groups

DOI10.2307/2008443zbMath0760.20002OpenAlexW4245832310MaRDI QIDQ4712164

Lajos Rónyai, László Babai

Publication date: 25 June 1992

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

zbMATH Keywords

generatorspolynomial-time algorithmirreducible representationsfinite groupbit-complexitymultiplication table

Mathematics Subject Classification ID

Related Items (17)

Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) ⋮ Finding the dimension of a non-empty orthogonal array polytope ⋮ Extensions of irreducible representations ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ Quasirandom Groups ⋮ An algorithm for constructing representations of finite groups. ⋮ Computational bounds for doing harmonic analysis on permutation modules of finite groups ⋮ Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\) ⋮ Decomposition of algebras over finite fields and number fields ⋮ Symmetry in semidefinite programs ⋮ A note on the Hambleton-Taylor-Williams conjecture ⋮ Unnamed Item ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Integrality, duality and finiteness in combinatoric topological strings

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