A recognition algorithm for classical groups over finite fields

Proceedings of the London Mathematical Society

Volumn 77, Issue 1, 1998, Pages 117-169

  Niemeyer, Alice C ^a   Praeger, Cheryl E ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001609240     PISSN: 00246115     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024611598000422     Document Type: Article

References (37)

1. M. ASCHBACHER, 'On the maximal subgroups of the finite classical groups', Invent. Math. 76 (1984) 469-514.
2. JAMES C. BEIDLEMAN and DEREK J. S. ROBINSON, 'On finite groups satisfying the permutizer condition', J. Algebra 191 (1997) 686-703.
3. WIEB BOSMA and JOHN CANNON, 'Handbook of MAGMA functions', Department of Pure Mathematics, Sydney University, 1993.
4. P. J. CAMERON, 'Finite permutation groups and finite simple groups', Bull. London Math. Soc. 13 (1981) 1-22.
5. DAVID G. CANTOR and HANS ZASSENHAUS, 'A new algorithm for factoring polynomials over finite fields', Math. Comp. 36 (1981) 587-592.
6. FRANK CELLER and C. R. LEEDHAM-GREEN, 'Calculating the order of an invertible matrix', Groups and computation II, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 28 (eds Larry Finkelstein and William M. Kantor, American Mathematical Society, Providence, R.I., 1997), pp. 55-60.
7. FRANK CELLER and C. R. LEEDHAM-GREEN, 'A non-constructive recognition algorithm for the special linear and other classical groups', Groups and computation II, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 28 (eds Larry Finkelstein and William M. Kantor, American Mathematical Society, Providence, R.I., 1997), pp. 61-67.
8. FRANK CELLER, CHARLES R. LEEDHAM-GREEN, SCOTT H. MURRAY, ALICE C. NIEMEYER, and E. A. O'BRIEN. 'Generating random elements of a finite group', Comm. Algebra 23 (1995) 4931-4948.
9. J. H. CONWAY, R. T. CURTIS, S. P. NORTON, R. A. PARKER, and R. A. WILSON, Atlas of finite groups (Clarendon Press, Oxford, 1985).
10. WALTER FEIT, 'On large Zsigmondy primes', Proc. Amer. Math. Soc. 102 (1988) 29-36.
11. ROBERT M. GURALNICK, TIM PENTTILA, CHERYL E. PRAEGER, and JAN SAXL, 'Linear groups with orders having certain large prime divisors', Proc. London Math. Soc. to appear.
12. C. HERING, 'Transitive linear groups and linear groups which contain irreducible subgroups of prime order', Geom. Dedicata 2 (1974) 425-460.
13. C. HERING, 'Transitive linear groups and linear groups which contain irreducible subgroups of prime order, II', J. Algebra 93 (1985) 151-164.
14. DEREK F. HOLT and SARAH REES, 'An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups', J. Experimental Math. 1 (1992) 237-242.
15. DEREK F. HOLT and SARAH REES, 'Testing modules for irreducibility', J. Austral. Math. Soc. Ser. A 57 (1994) 1-16.
16. DEREK F. HOLT, CHARLES R. LEEDHAM-GREEN, SARAH REES, and E. A. O'BRIEN, 'Testing matrix groups for primitivity', J. Algebra 184 (1996) 795-817.
17. DEREK F. HOLT, CHARLES R. LEEDHAM-GREEN, SARAH REES, and E. A. O'BRIEN, 'Computing matrix group decompositions with respect to a normal subgroup', J. Algebra 184 (1996) 818-838.
18. B. HUPPERT, Endliche Gruppen I, Grundlehren Math. Wiss. 134 (Springer, Berlin, 1967).
19. I. MARTIN ISAACS, Character theory of finite groups (Academic Press, San Diego, 1976).
20. CHRISTOPH JANSEN, KLAUS LUX, RICHARD PARKER, and ROBERT WILSON, An atlas of Brauer characters, London Mathematical Society Monographs, New Series 11 (Oxford Science Publications, 1995).
21. PETER KLEIDMAN and MARTIN LIEBECK, The subgroup structure of the finite classical groups, London Mathematical Society Lecture Note Series 129 (Cambridge University Press, 1990).
22. DONALD E. KNUTH, The art of computer programming, vol. 2 (Addison-Wesley, New York, 1981, 1969).
23. WILLIAM J. LEVEQUE, Elementary theory of numbers (Addison-Wesley, London, 1962).
24. T. ŁUCZAK and L. PYBER, 'On random generation of the symmetric group', Combin. Probab. Comput. 2 (1993) 505-512.
25. PETER M. NEUMANN, 'Transitive permutation groups of prime degree', J. London Math. Soc. (2) 5 (1972) 202-208.
26. PETER M. NEUMANN and CHERYL E. PRAEGER, 'A recognition algorithm for special linear groups', Proc. London Math. Soc. (3) 65 (1992) 555-603.
27. ALICE C. NIEMEYER and CHERYL E. PRAEGER, 'Implementing a recognition algorithm for classical groups', Groups and computation II, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 28 (eds Larry Finkelstein and William M. Kantor, American Mathematical Society, Providence, R.I., 1997), pp. 273-296.
28. IVAN NIVEN, HERBERT S. ZUCKERMAN, and HUGH L. MONTGOMERY, An introduction to the theory of numbers, 5th edn (John Wiley, New York, 1991).
29. R. A. PARKER, 'The computer calculation of modular characters (the Meat-Axe)', Computational group theory, Proceedings of the London Mathematical Society Symposium on Computational Group Theory (ed. Michael Atkinson, Academic Press, London, 1984), pp. 267-274.
30. CHERYL E. PRAEGER, 'Primitive prime divisor elements in finite classical groups', Proceedings of Groups St. Andrews in Bath 1997 (Cambridge University Press, to appear).
31. GERHARD J. A. SCHNEIDER, 'Computing with endomorphism rings of modular representations', J. Symbolic Comput. 9 (1990) 607-636.
32. M. SCHÖNERT et al., 'GAP - Groups, algorithms and programming', RWTH Aachen: Lehrstuhl D für Mathematik, 5th edn, 1995 (http://www.gap.dsc.st-and.ac.uk/gap).
33. ANER SHALEV, 'A theorem on random matrices and some applications', J. Algebra to appear.
34. L. SOICHER and J. MCKAY, 'Computing Galois groups over the rationals', J. Number Theory 20 (1985) 273-281.
35. HELMUT WIELANDT, Finite permutation groups (Academic Press, New York, 1964).
36. K. ZSIGMONDY, 'Zur Theorie der Potenzreste', Monatsh. für Math. u. Phys. 3 (1892) 265-284.
37. ALICE C. NIEMEYER and CHERYL E. PRAEGER, 'A recognition algorithm for non-generic classical groups over finite fields', preprint, University of Western Australia, 1998.