Abstract A complete procedure is described for constructing the irreducible KG-modules and their Brauer characters, where K is a finite field of characteristic p and G is a finite permutation… Click to show full abstract
Abstract A complete procedure is described for constructing the irreducible KG-modules and their Brauer characters, where K is a finite field of characteristic p and G is a finite permutation or matrix group. The central idea is to construct a sequence { S 1 , … , S n } of KG-modules, each having relatively small dimension, such that each S i has one or more irreducible constituents that are not constituents of S 1 , … , S i − 1 . The Meataxe, used in conjunction with condensation, is used to extract the new irreducibles from each S i . The algorithm has been implemented in Magma and is capable of constructing irreducibles of dimension over 200 000 .
               
Click one of the above tabs to view related content.