Recognizing finite matrix groups over infinite fields. (Q1930160): Difference between revisions

The authors continue their investigations into computation with finitely generated matrix groups over infinite fields (see, for example, \textit{A. S. Detinko} and \textit{D. L. Flannery}, J. Symb. Comput. 44, No. 8, 1037-1043 (2009; Zbl 1172.20310)] and the authors [J. Algebra 344, No. 1, 397-406 (2011; Zbl 1245.20062)]). The primary tool is the use of congruence homomorphisms to map a finitely generated matrix group \(G\) over an infinite field onto a matrix group of the same degree over a finite field \(K\) of characteristic \(p\), say; all the torsion elements in the kernel are \(p\)-elements. For finitely generated matrix groups \(G\) over quite general fields this enables the construction of a normal subgroup \(N\) of finite index in \(G\) such that \(N\) is torsion free (the authors call such a subgroup an SW-subgroup). This construction can then be used to decide whether \(G\) is finite and, if so, compute an isomorphic copy of \(G\) as a matrix group over a finite field, and hence determine various properties of \(G\). Some of the algorithms described have been implemented in the package \texttt{Infinite} in \texttt{Magma}, and examples of typical runtimes are provided.