Computing Irreducible Representations of Supersolvable Groups

DOI10.2307/2153580zbMath0830.20031OpenAlexW2068120967MaRDI QIDQ4305962

Ulrich Baum, Michael Clausen

Publication date: 24 January 1996

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

zbMATH Keywords

algorithmsirreducible representationssupersolvable groupsrunning timepower-commutator presentations

Mathematics Subject Classification ID

Related Items (8)

Generating fast Fourier transforms of solvable groups ⋮ An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. ⋮ An algorithm for constructing representations of finite groups. ⋮ DFT-based word normalization in finite supersolvable groups. ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Computing irreducible representations of supersolvable groups over small finite fields ⋮ RepLAB: A Computational/Numerical Approach to Representation Theory ⋮ Decomposing monomial representations of solvable groups.

Cites Work

• Unnamed Item
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• Fast generalized Fourier transforms

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