A recognition algorithm for non-generic classical groups over finite fields

Citation
Ac. Niemeyer et Ce. Praeger, A recognition algorithm for non-generic classical groups over finite fields, J AUS MAT A, 67, 1999, pp. 223-253
Citations number
13
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS
ISSN journal
02636115 → ACNP
Volume
67
Year of publication
1999
Part
2
Pages
223 - 253
Database
ISI
SICI code
0263-6115(199910)67:<223:ARAFNC>2.0.ZU;2-J
Abstract
In a previous paper the authors described an algorithm to determine whether a group of matrices over a finite field, generated by a given set of matri ces, contains one of the classical groups or the special linear group. The algorithm was designed to work for all sufficiently large field sizes and d imensions of the matrix group. However, it did not apply to certain small c ases. Here we present an algorithm to handle the remaining cases. The theor etical background of the algorithm presented in this paper is a substantial extension of that needed for the original algorithm.