A parallel architecture for disk-based computing over the baby monster and other large finite simple groups

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2006, Issue , 2006, Pages 298-305

  Robinson, Eric ^a   Cooperman, Gene ^a  

^a Northeastern University   (United States)

Author keywords

Baby Monster group; Disk based methods; Group membership; Matrix groups; Parallel computation; Permutation groups

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; VECTOR QUANTIZATION;

BABY MONSTER GROUP; DISK-BASED METHODS; GROUP MEMBERSHIP; MATRIX GROUPS; PARALLEL COMPUTATION; PERMUTATION GROUPS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748986160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145817     Document Type: Conference Paper

References (41)

1. L. Babai, G. Cooperman, L. Finkelstein, E. M. Luks, and A. Seress. Fast Monte Carlo algorithms for permutation groups. J. Comp. Syst. Sci., 50:296-308, 1995.
2. L. Babai, G. Cooperman, L. Finkelstein, and A. Seress. Nearly linear time algorithms for permutation groups with a small base. In Proc. of International Symposium on Symbolic and Algebraic Computation ISSAC '91, pages 200-209. (Bonn), ACM Press, 1991.
3. L. Babai, E. M. Luks, and A. Seress. Fast management of permutation groups I. SIAM J. Computing, 26:1310-1342, 1997.
4. L. Babai and A. Shalev. Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups. In Groups and Computation III, Ohio State Univ. Math. Res. Inst. Publ., Berlin, 2000. (Ohio, 1999), de Gruyter.
5. W. Bosma, J. Cannon, and C. Playoust. The MAGMA algebra system i: The user language. J. Symbolic Comput., 24:235-265, 1997.
6. G. Butler. The Schreier algorithm for matrix groups. In SYMSAC '76, Proc. ACM Sympos. symbolic and algebraic computation, pages 167-170, New York, 1976. (New York, 1976), Association for Computing Machinery.
7. G. Butler and J. J. Cannon. Computing in permutation and matrix groups I: Normal closure, commutator subgroups, series. Math. Comp., 39:663-670, 1982.
8. F. Celler, C. R. Leedham-Green, S. H. Murray, A. C. Niemeyer, and E. O'Brien. Generating random elements of a finite group. Comm. Algebra, 23:4931-4948, 1995.
9. Cooperman, Finkelstein, and Sarawagi. Applications of cayley graphs. In AAECC: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, International Conference. LNCS, Springer-Verlag, 1990.
10. th International Symposium on High Performance Distributed Computing (HPDC-5), pages 141-150. IEEE Press, 1996. software at http://www.ccs.neu.edu/ home/gene/topc.html.
11. G. Cooperman and L. Finkelstein. Randomized algorithms for permutation groups. Centrum Wissenschaft Institut Quarterly (CWI), pages 107-125, June 1992.
12. G. Cooperman and L. Finkelstein. Combinatorial tools for computational group theory. In Groups and Computation, volume 11 of Amer. Math. Soc. DIMACS Series, pages 53-86. (DIMACS, 1991), 1993.
13. G. Cooperman and L. Finkelstein. A random base change algorithm for permutation groups. J. Symbolic Comput., 17:513-528, 1994.
14. G. Cooperman, L. Finkelstein, and N. Sarawagi. A random base change algorithm for permutation groups. In Proc. of International Symposium on Symbolic and Algebraic Computation ISSAC '90, pages 161-168, Tokyo, Japan, 1990.
15. G. Cooperman, L. Finkelstein, M. Tselman, and B. York. Constructing permutation representations for matrix groups. J. Symbolic Comput., 1997.
16. G. Cooperman, L. Finkelstein, B. York, and M. Tselman. Constructing permutation representations for large matrix groups. In Proceedings of International Symposium on Symbolic and Algebraic Computation ISSAC '94, pages 134-138, New York, 1994. (Oxford), ACM Press.
17. G. Cooperman and G. Havas. Practical parallel coset enumeration. In Workshop on High Performance Computing and Gigabit Local Area Networks, volume 226 of Lecture Notes in Control and Information Sciences, pages 15-27, 1997.
18. G. Cooperman, G. Hiss, K. Lux, and J. Müller. The Brauer tree of the principal 19-block of the sporadic simple thompson group. J. Experimental Math., 6:293-300, 1997.
19. G. Cooperman, W. Lempken, G. Michler, and M. Weller. A new existence proof of Janko's simple group J4. In Computational Methods for Representations of Groups and Algebras, volume 173 of Progress in Mathematics, pages 161-175, 1999.
20. G. Cooperman and E. Robinson. Memory-based and disk-based algorithms for very high degree permutation groups. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '03), pages 66-73. ACM Press, 2004.
21. G. Cooperman and M. Tselman. New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '96), pages 155-160. ACM Press, 1996.
22. The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4-3, 2002. http://www.gap-system.org.
23. H. Gollan. A new existence proof for Ly, the sporadic simple group of R. Lyons. Preprint 30, 1995.
24. H. Gollan. A new existence proof for Ly, the sporadic simple group of R. Lyons. J. Symbolic Comput., 31:203-209, 2001.
25. H. Gollan and G. Havas. On Sims' presentation for Lyons' simple group. In Computational Methods for Representations of Groups and Algebras, volume 173 of Progress in Mathematics, pages 235-240, 1999.
26. G. Havas and C. Sims. A presentation for the Lyons simple group. In Computational Methods for Representations of Groups and Algebras, volume 173 of Progress in Mathematics, pages 241-249, 1999.
27. G. Havas, L. Soicher, and R. Wilson. A presentation for the Thompson sporadic simple group. In Groups and Computation III, pages 193-200, New York, 2001. (Ohio, 1999), de Gruyter.
28. P. E. Holmes and R. A. Wilson. A new computer construction of the Monster using 2-local subgroups. J. London Math. Soc., 67:349-364, 2003.
29. W. M. Kantor. Sylow's theorem in polynomial time. J. Comp. Syst. Sci., 30:359-394, 1985.
30. C. Leedham-Green. The computational matrix group project. In Groups and Computation III, pages 229-248, New York, 2001. (Ohio, 1999), de Gruyter.
31. C. Leedham-Green, E. O'Brien, and C. Praeger. Recognising matrix groups. In J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors, Computer Algebra Handbook, pages 474-475, 2003.
32. S. A. Linton, R. A. Parker, P. G. Walsh, and R. A. Wilson. Computer construction of the Monster. J. Group Theory, 1:307-337, 1998.
33. F. Lübeck and M. Neunhöffer. Enumerating large orbits and direct condensation. Experiment. Math, 10:197-206, 2001.
34. E. M. Luks. Computing the composition factors of a permutation group in polynomial time. Combinatorial, 7:87-99, 1987.
35. S. H. Murray and E. O'Brien. Selecting base points for the Schreier-Sims algorithm for matrix groups. J. Symbolic Comput., 19:577-584, 1995.
36. C. C. Sims. Computation with permutation groups. In Proc. Second Symp. on Symbolic and Algebraic Manipulation. ACM Press, 1971.
37. C. C. Sims. How to construct a baby monster. In M. Collins, editor, Finite simple groups II, pages 339-345. (Durham 1978), Academic Press, 1980.
38. M. Weller. Construction of large permutation representations for matrix groups. In W. J. E. Krause, editor, High Performance Computing in Science and Engineering '98, pages 430-. Springer, 1999.
39. M. Weller. Construction of large permutation representations for matrix groups ii. Applicable Algebra in Engineering, Communication and Computing, 11:463-488, 2001.
40. M. Weller. Computer aided existence proof of Thompson's sporadic simple group, manuscript, 2003.
41. R. Wilson. Atlas of finite group representations. http://www.mat.bh.am. ac.uk/atlas.