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

    Research output: Contribution to journalArticle

    6 Citations (Scopus)

    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 matrices, contains one of the classical groups or the special linear group. The algorithm was designed to work for all sufficiently large field sizes and dimensions of the matrix group. However, it did not apply to certain small cases. Here we present an algorithm to handle the remaining cases. The theoretical background of the algorithm presented in this paper is a substantial extension of that needed for the original algorithm.
    Original languageEnglish
    Pages (from-to)223-253
    JournalJournal of the Australian Mathematical Society Series A - Pure Mathematics and Statistics
    Volume67
    DOIs
    Publication statusPublished - 1999

    Fingerprint Dive into the research topics of 'A recognition algorithm for non-generic classical groups over finite fields'. Together they form a unique fingerprint.

    Cite this