IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-58600-2_41.html
   My bibliography  Save this book chapter

Construction of Large Permutation Representations for Matrix Groups

In: High Performance Computing in Science and Engineering ’98

Author

Listed:
  • Michael Weller

    (University of Essen, Institute for Experimental Mathematics)

Abstract

This article describes the general computational tools for a new proof of the existence of the large sporadic simple Janko group J 4 [10] given by Cooperman, Lempken, Michler and the author [7] which is independent of Norton [12] and Benson [1]. Its basic step requires a generalization of the Cooperman, Finkelstein, Tselman and York algorithm [6] transforming a matrix group into a permutation group. An efficient implementation of this algorithm on high performance parallel computers is described. Another general algorithm is given for the construction of representatives of the double cosets of the stabilizer of this permutation representation. It is then used to compute a base and strong generating set for the permutation group. In particular, we obtain an algorithm for computing the group order of a large matrix subgroup of GL n (q), provided we are given enough computational means. It is applied to the subgroup G = 〈x, y〉

Suggested Citation

  • Michael Weller, 1999. "Construction of Large Permutation Representations for Matrix Groups," Springer Books, in: Egon Krause & Willi Jäger (ed.), High Performance Computing in Science and Engineering ’98, pages 430-452, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-58600-2_41
    DOI: 10.1007/978-3-642-58600-2_41
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-58600-2_41. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.