Constructing permutation representations for matrix groups

Journal of Symbolic Computation

Volumn 24, Issue 3-4, 1997, Pages 471-488

  Cooperman, Gene ^a   Finkelstein, Larry ^a   Tselman, Michael ^a   York, Bryant ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031234514     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0146     Document Type: Article

References (34)

1. Aho, A., Hopcroft, J., Ullman, J. (1974). The Design and Analysis of Computer Algorithms, p. 245. Addison-Wesley.
2. Arlazarov, V.L., Dinic, E. A., Kronrod, M. A., Faradzev, I. A. (1970). On economical construction of the transitive closure of a directed graph, Dokl. Nauk SSSR 194, pp. 487-488. English translation in Soviet Math. Dokl. 11:5, pp. 1209-1210.
3. Arlazarov, V.L., Dinic, E. A., Kronrod, M. A., Faradzev, I. A. (1970). On economical construction of the transitive closure of a directed graph, Dokl. Nauk SSSR 194, pp. 487-488. English translation in Soviet Math. Dokl. 11:5, pp. 1209-1210.
4. Babai, L., Szemerédi, E. (1984). On the complexity of matrix group problems I. In Proc. 25th IEEE FOCS, Palm Beach, FL, pp. 229-240.
5. Babai, L. (1991). Local expansion of vertex-transitive graphs and random generation in finite groups. In Proc. 23rd ACM STOC.
6. Babai, L., Beals, R. (1993). Las Vegas algorithms for matrix groups. In Proc. 24th IEEE FOCS, pp. 427-436.
7. Babai, L., Cooperman, G., Finkelstein, L., Seress Á. (1991). Nearly linear time algorithms for permutation groups with a small base. In Proc. of the 1991 International Symposium on Symbolic and Algebraic Computation (ISSAC '91), Bonn, pp. 200-209.
8. Beals, R. (1993). Computing blocks of imprimitivity for small-base groups in nearly linear time. In Finkelstein, L., Kantor, W. M. (eds), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, pp. 17-26. Providence, RI: AMS.
9. Butler, G. (1976). The Schreier algorithm for matrix groups. In Proc. ACM Symp. Symbolic and Algebraic Computation (SYMSAC '76) pp. 167-170, New York: ACM.
10. Butler, G., Cannon, J. (1982). Computing in permutation and matrix groups I: normal closure, commutator subgroups, series. Math. Comp. 39, pp. 663-670.
11. Butler, G., Cannon, J. (1989). Cayley, version 4: the user language. In Proceedings of 1988 International Symposium on Symbolic and Algebraic Computation, Lecture Notes in Computer Science 358, pp. 456-466. Berlin: Springer-Verlag.
12. Cannon, J., Gallagher, R., McAllister, K. (1972). STACKHANDLER: A language extension for low level set processing. Programming and implementation manual. Technical Report 5, Dept. of Pure Mathematics, University of Sydney.
13. Cannon, J., Richardson, J. (1973). The GROUP system for investigating the structure of groups. User and maintenance manual. Technical Report 8, Dept. of Pure Mathematics, University of Sydney.
14. Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. A., Wilson, R. A. (1985). Atlas of Finite Groups. Oxford: Clarendon Press.
15. Cooperman, G. (1995). STAR/MPI: Binding a parallel library to interactive symbolic algebra systems. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '95), pp. 126-132. ACM Press.
16. Cooperman, G., Finkelstein, L. (1993). Combinatorial tools for computational group theory. In Finkelstein, L., Kantor, W. M., (eds), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, pp. 53-86. Providence, RI: AMS.
17. Cooperman, G., Finkelstein, L., York, B., Tselman, M. (1994). Constructing permutation representations for large matrix groups. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC'94), pp. 134-138. ACM Press.
18. Cooperman, G., Finkelstein, L., Tselman, M. (1995). Computing with matrix groups using permutation representations. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '95), pp. 259-26. ACM Press.
19. Gollan, H. W. (1995). A new existence proof for Ly, the sporadic simple group of R. Lyons,.
20. Gollan, H. W., Michler, G. O. (1997). Construction of a 45 694-dimensional simple module of Lyons' sporadic group over GF(2). Linear Algebra and its Applications 256, 185-98
21. Gorenstein, D. (1982). The Classification of Finite Simple Groups, vol. 1. New York: Plenum Press.
22. Holt, D., Leedham-Green, C., O'Brien, E., Rees, S. (1996a). Computing Matrix Group Decompositions with Respect to a Normal Subgroup. J. Algebra 184, 818-38.
23. Holt, D., Leedham-Green, C., O'Brien, E., Rees, S. (1996b). Testing matrix groups for primitivity. J. Algebra 184, 795-817.
24. Holt, D., Rees, S. (1994). Testing modules for irreducibility. J. Australian Mathematics Society Ser. A 57.
25. Huppert, B. (1967). Endliche Gruppen I. New York: Springer-Verlag.
26. Landazuri, V., Seitz, G. M. (1974). On the minimal degrees of projective representations of the finite Chevalley groups, J. Algebra 32, 418-443.
27. Leedham-Green, C., (1993). Lecture at the MAGMA Conference, London, England, August, 1993.
28. Luks, E. M. (1992). Computing in solvable matrix groups. In Proc. 33rd IEEE FOCS, pp. 111-120.
29. Lyons, R. (1972). Evidence for a new finite simple group. J. Algebra 20, 540-569.
30. Message Passing Interface Forum (author) (1994). MPI: A message-passing interface standard. Int. J. Supercomputing Applications 8(3/4).
31. Parker, R. (1984). The computer calculation of modular characters. (The Meat-Axe). In Atkinson, M. (ed.), Computational Group Theory, pp. 267-274. London: Academic Press.
32. Praeger, C. E., Soicher, L. H. (to appear). Low rank representations and graphs for sporadic groups. Australian Math. Soc. Lecture Notes, vol 8. Cambridge: Cambridge University Press.
33. Sims, C. C. (1972). The existence and uniqueness of Lyons group. In Proceeding of the Gainseville Conference, pp. 138-141.
34. Tselman, M. (1996), Computing permutation representations for matrix groups in a distributed environment. In Finkelstein, L., Kantor, W. M. (eds), Proc. of DIMACS Workshop on Groups and Computation II (1995), DIMACS Series in Discrete Mathematics and Theoretical Computer Science (to appear). Providence, RI: AMS.