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〉 < GL1333(11) corresponding to Lempken’s construction of J 4 [11].
The work on this paper has been supported by the DFG research project “Algorithmic Number Theory and Algebra”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. J. Benson. The Simple Group J 4. PhD thesis, Trinity College, Cambridge, August 1980.
W. Bosma and J. Cannon. Handbook of Magma functions. Department of Pure Mathematics, University of Sydney, 1994.
G. Butler. Fundamental Algorithms for Permutation Groups, volume 559 of Lecture Notes in Comput. Sci. Springer-Verlag, Berlin, Heidelberg, New York, 1991.
J. Cannon and G. Havas. Algorithms for groups. Australian Computer Journal, 24(2):51–60, 1992.
G. Cooperman. TOP-C: a Task-Oriented Parallel C interface. In 5th International Symposium on High Performance Distributed Computing (HPDC-5), pages 141–150. IEEE Press, 1996.
G. Cooperman, L. Finkelstein, M. Tselman, and B. York. Constructing permutation representations for matrix groups. J. Symbolic Comput., 1997.
G. Cooperman, W. Lempken, M. Weller, and G. O. Michler. A new existence proof of Janko’s simple group J 4. Preprint, 1997.
P. Fleischmann, G. O. Michler, P. Roelse, J. Rosenboom, R. Staszewski, C. Wagner, and M. Weller. Linear Algebra over Small Finite Fields on Parallel Machines, volume 23 of Vorlesungen aus dem Fachbereich Mathematik. University of Essen, 1995.
H. W. Gollan. A new existence proof for Ly, the sporadic simple group of R. Lyons. Preprint 30, Institut für Experimentelle Mathematik, University of Essen, Ellernstraße 29, 45326 Essen, Germany, 1995.
Z. Janko. A new finite simple group of order 86,775,571,046,077,562,880 which possesses M 24 and the full covering group of M 22 as subgroups. J. Algebra, 42:564–596, 1976.
W. Lempken. Constructing J 4 in GL(1333, 11). Comm. Algebra, 21:4311–3251, 1993.
S. Norton. The construction of J 4. In B. Cooperstein and G. Mason, editors, Proc. Santa Cruz Conference on Finite Groups, pages 271–277. Amer. Math. Soc., 1980.
R. Parker. The computer calculation of modular characters (the Meat-Axe). In M. Atkinson, editor, Computational Group Theory, pages 267–274, London, New York, 1984. (Durham, 1982), Academic Press.
M. Ringe. The C MeatAxe. Lehrstuhl D für Mathematik, RWTH, Aachen, 1992.
M. Weller and G. O. Michler. A new computer construction of the irreducible 112-dimensional 2-modular representation of Janko’s group J 4. In preparation, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weller, M. (1999). Construction of Large Permutation Representations for Matrix Groups. In: Krause, E., Jäger, W. (eds) High Performance Computing in Science and Engineering ’98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58600-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-58600-2_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63661-5
Online ISBN: 978-3-642-58600-2
eBook Packages: Springer Book Archive