Constructive recognition of classical groups in their natural representation

Journal of Symbolic Computation

Volumn 35, Issue 2, 2003, Pages 195-239

  Brooksbank, Peter A ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037331290     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(02)00132-3     Document Type: Review

References (22)

1. Babai, L., 1991. Local expansion of vertex-transitive graphs and random generation in finite groups. Proceedings of the ACM Symposium on Theory of Computing. pp. 164-174.
2. Brooksbank, P., 2001a. A constructive recognition algorithm for the matrix group Ω(d, q). In: Kantor, W.M., Seress, Á. (Eds.), Groups and Computation III, vol. 8. Ohio State University Math. Res. Inst. Publ., Walter de Gruyter, Berlin, New York.
3. Brooksbank, P., 2001b. Constructive recognition of the finite simple classical groups. Ph. D. Thesis, U. Oregon.
4. Celler, F., 1997. Matrixgruppenalgorithmen in GAP. Ph. D. Thesis, RWTH Aachen.
5. Celler, F., Leedham-Green, C.R., 1998. A constructive recognition algorithm for the special linear group. The Atlas of Finite Groups: Ten Years On (Birmingham 1995), London Mathematical Society Lecture Note Series, vol. 249.
6. Celler, F., Leedham-Green, C.R., Murray, S.H., Niemeyer, A.C., O'Brien, E.A., 1995. Generating random elements of a finite group. Commun. Algebra 23, 4931-4948.
7. Conder, M., Leedham-Green, C.R., 2001. Fast recognition of classical groups over large fields. In: Kantor, W.M., Seress, Á. (Eds.), Groups and Computation III, vol. 8. Ohio State University Math. Res. Inst. Publ., Walter de Gruyter, Berlin, New York.
8. Conder, M., Leedham-Green, C.R., O'Brien, E.A., 2002. Constructive recognition of SL(2, q) (in preparation).
9. The GAP Group, 2000. Groups, Algorithms, and Programming, Version 4.2; Aachen, St Andrews. Available from http://www-gap.dcs.st-and.ae.uk/gap.
10. Holt, D.F., Leedham-Green, C.R., O'Brien, E.A., Rees, S., 1996. Computing matrix group decompositions with respect to a normal subgroup. J. Algebra 184, 795-817.
11. Holt, D.F., Rees, S., 1994. Testing modules for irreducibility. J. Aust. Math. Soc. (Ser. A) 57, 1-16.
12. Kantor, W.M., Liebler, R.A., 1982. The rank 3 permutation representations of the finite classical groups. TAMS 271, 1-71.
13. Kantor, W.M., Seress, Á., 2001. Black box classical groups. Mem. Amer. Math. Soc. 149 (708).
14. Kleidman, P.B., Liebeck, M.W., 1990. The Subgroup Structure of the Finite Classical Groups. LMS Lecture Note Series, vol. 129. Cambridge University Press, Cambridge, New York.
15. Leedham-Green, C.R., 2001. The computational matrix group project. In: Kantor, W.M., Seress, Á. (Eds.), Groups and Computation III. Ohio State University Math. Res. Inst. Publ., vol. 8. Walter de Gruyter, Berlin, New York.
16. Leedham-Green, C.R., O'Brien, E.A., 1997. Recognising tensor products of matrix groups. Int. J. Algebra Comput. 7, 541-559.
17. Lidl, R., Niederreiter, H., 1983. Finite Fields, Encyclopedia of Mathematics and its Applications, vol. 20. Addison-Wesley.
18. Neumann, P.M., Praeger, C.E., 1992. A recognition algorithm for special linear groups. Proc. London Math. Soc, (3) 65, 555-603.
19. Niemeyer, A.C., Praeger, C.E., 1998. A recognition algorithm for classical groups over finite fields. Proc. London Math. Soc. (1) 77, 117-169.
20. Seress, Á., 2002. Permutation Group Algorithms, Cambridge University Press (to appear).
21. Taylor, D.E., 1992. The geometry of the classical groups. Heldermann, Berlin.
22. Zsigmondy, K., 1892. Zur theorie der potenzreste. Monatsh. Math., Phys. 3, 265-284.