Skip to main content
Article thumbnail
Location of Repository

Computing irreducible representations of supersolvable groups over small finite fields

By A. Omrani and A. Shokrollahi

Abstract

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 (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effective version of Speiser’s generalization of Hilbert’s Theorem 90 stating that H 1 (Gal(L/K), GL(n, L)) vanishes for all n ≥ 1. 1. Introduction an

Year: 1997
OAI identifier: oai:CiteSeerX.psu:10.1.1.192.5168
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ams.org/journals/mc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.