Computing Irreducible Representations of Supersolvable Groups over Small Finite Fields

TitleComputing Irreducible Representations of Supersolvable Groups over Small Finite Fields
Publication TypeTechnical Report
Year of Publication1996
AuthorsOmrani A., M. Shokrollahi A
Other Numbers1015
KeywordsComputational representation theory, Galois cohomology
Abstract

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.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1996/tr-96-005.pdf
Bibliographic Notes

ICSI Technical Report TR-96-005

Abbreviated Authors

A. Omrani and A. Shokrollahi

ICSI Publication Type

Technical Report