Publication Details

Title: Computing Irreducible Representations of Supersolvable Groups over Small Finite Fields
Author: A. Omrani and A. Shokrollahi
Group: ICSI Technical Reports
Date: January 1996
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1996/tr-96-005.pdf

Overview:
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK /| |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen[1] to obtain information on algebraically conjugate representations, and an effective version of Speiser's generalization of Hilbert's Theorem 90 stating that H1(Gal(L/K), GL(n,L)) vanishes for all n ≥ 1. Keywords: Computational representation theory, Galois cohomology

Bibliographic Information:
ICSI Technical Report TR-96-005

Bibliographic Reference:
A. Omrani and A. Shokrollahi. Computing Irreducible Representations of Supersolvable Groups over Small Finite Fields. ICSI Technical Report TR-96-005, January 1996