The computer construction of matrix representations of finite groups over finite fields (Q1814030)

The authors describe a method which has become standard to construct matrix representations of finite groups over finite fields by computational means, and which --- for obvious reasons --- may be called ``amalgam-method''. Suppose \(G\) is a finite group with proper subgroups \(H_ 1\), \(H_ 2\), and \(K\) such that \(G=\langle H_ 1,H_ 2\rangle\) and \(K=H_ 1\cap H_ 2\) (i.e. \(G\) is an amalgam of \(H_ 1\) and \(H_ 2\) over \(K\)). Assume that \(G\) can be represented on the vector space \(V=F^ n\), \(F\) a finite field of prime characteristic. In order to build the representation \(f: G\to GL(V)\) perform the following steps: (1) Construct representations \(f_ i: H_ i\to GL(V)\) such that \(f_ i(H_ i)\cong f(H_ i)\), \(i\in \{1,2\}\). (2) Find generators for \(f_ i(K)\) inside \(f_ i(H_ i)\). (3) Change \(f_ 1\) to an equivalent representation \(f_ 1'\) so that \(f_ 1'(K)=f_ 2(K)\). (4) Change \(f_ 1'\) to an equivalent representation \(f_ 1''\) while keeping \(f_ 1''(K)=f_ 1'(K)\) until \[ \langle f_ 1''(H_ 1),f_ 2(H_ 2)\rangle\cong G. \] These steps are illustrated and explained in more detail with the example of the simple Lyons group \(Ly\) in its 111- dimensional \(GF(5)\)-representation using the subgroups \(H_ 1\cong \hat 2 A_{11}\), \(H_ 2\cong S_ 3\times M_{11}\) and \(K=H_ 1\cap H_ 2\cong 2\times M_{11}\).