Algorithms for matrix groups and the Tits alternative

Journal of Computer and System Sciences

Volumn 58, Issue 2, 1999, Pages 260-279

  Beals, Robert ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

HOMOMORPHISM; MEMBERSHIP TESTING; POLYNOMIAL TIME ALGORITHM;

MATRIX ALGEBRA;

EID: 0032631460     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1614     Document Type: Article

References (55)

1. [Atk75] M. D. Atkinson, An algorithm for finding the blocks of a permutation group, Math. Comp. 29 (1975), 911-913.
2. [Atk84] M. D. Atkinson (Ed.), "Computational Group Theory," Proceedings of the London Mathematical Society Symposium on Computational Group Theory, Academic Press, London, 1984.
3. [Ba79] L. Babai, Monte-Carlo algorithms in graph isomorphism testing, unpublished manuscript, 1979.
4. [Ba85] L. Babai, Trading group theory for randomness, in "Proc 17th ACM STOC, Providence, RI, 1985," pp. 421-429.
5. [Ba91a] L. Babai, Computational complexity in finite groups, in "Proc. International Congress of Mathematics, Kyoto, 1990," pp. 1479-1489, Springer-Verlag, Hong Kong, 1991.
6. [Ba92] L. Babai, Deciding finiteness of matrix groups in Las Vegas polynomial time, in "Proc. 3rd ACM-SIAM SODA (Symp. on Discrete Algorithmss), 1992," pp. 33-40.
7. [BBCIL] L. Babai, R. Beals, J.-y. Cai, G. Ivanyos, and E. M. Luks, Multiplicative equations over commuting matrices, in "Proc. 7th ACM-SIAM SODA, 1996," pp. 498-507.
8. [BBR] L. Babai, R. Beals, and D. Rockmore, Deciding finiteness of matrix groups in deterministic polynomial time, Israel J. Math., to appear.
9. [BCFLS] L. Babai, G. Cooperman, L. Finkelstein, E. M. Luks, and A. Seress, Fast Monte Carlo algorithms for permutation groups, in "Proc. 23rd ACM STOC, 1991," pp. 90-100.
10. [BLS87] L. Babai, E. M. Luks, and Á. Seress, Permutation groups in NC, in "Proc. 19th ACM STOC, 1987," pp. 409-420.
11. [BLS88] L. Babai, E. Luks, and Á. Seress, Fast management of permutation groups, in "Proc. 28th IEEE FOCS, 1988," pp. 272-282 .
12. [BSz] L. Babai, and E. Szemerédi, On the complexity of matrix group problems, in "Proc. 25th IEEE FOCS, 1984," pp. 229-240.
13. [BB] R. Beals and L. Babai, Las Vegas algorithms for matrix groups, in "Proc. 34th IEEE FOCS, 1993," pp. 427-436.
14. [BS] R. Beals and Á. Seress, Structure forest and composition factors in nearly linear time for small base groups, in "Proc. 24th ACM STOC, 1992," pp. 116-125.
15. [BCY] G. Brassard, C. Crépeau, and M. Yung, Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds, in "Proc. of the 16th ICALP, 1989," pp. 123-136, Springer-Verlag, Berlin.
16. [BY] G. Brassard, and M. Yung, One-Way Group Actions, in "Advances in Cryptology: CRYPTO '90 proceedings, 1991," Lecture Notes in Computer Science, Vol. 537, pp. 94-107, Springer-Verlag, Berlin.
17. [Bu] G. Butler, "Fundamental Algorithms for Permutation Groups," Lecture Notes in Computer Science, Vol. 559, Springer-Verlag, Berlin, 1991.
18. [CLZ] J.-y. Cai, R. J. Lipton, and Y. Zalcstein, The complexity of the membership problem for 2-generated commutative semigroups of rational matrices, in "Proc. 35th IEEE FOCS (1994)," pp. 135-142.
19. [Can] J. J. Cannon, An Introduction to the Group Theory Language, Cayley, Computational Group Theory, in "Proceedings of the London Mathematical Society Symposium on Computational Group Theory" (M. D. Atkinson, Ed.), pp. 145-184, Academic Press, London, 1984.
20. [FHL] M. L. Furst, J. Hopcroft, and E. M. Luks, Polynomial-time algorithms for permutation groups, in "21st IEEE FOCS, 1980," pp. 36-41.
21. [FR] K. Friedl and L. Rónyai, Polynomial time solutions of some problems in abstract algebra, in "Proc. 17th ACM STOC (1985)," pp. 153-162.
22. [Ga] F. R. Gantmacher, "Matrix Theory," Chelsea Publishing, New York, 1959.
23. [Ge93a] G. Ge, "Algorithms Related to Multiplicative Representations of Algebraic Numbers," Ph.D. thesis, Math. Dept., U.C. Berkeley, 1993.
24. [Ge93b] G. Ge, Testing equalities of multiplicative representations in polynomial time, in "Proc. 34th IEEE FOCS (1993)," pp. 422-426.
25. [HR] D. F. Holt and S. Rees, Testing modules for irreducibility, J. Austral. Math. Soc. Ser. A 57 (1994).
26. [H+96a] D. F. Holt, C. R. Leedham-Green, E. A. O'Brien, and S. Rees, Computing matrix group decompositions with respect to a normal subgroup, J. Algebra 184 (1996), 818.
27. [H+96b] D. F. Holt, C. R. Leedham-Green, E. A. O'Brien, and S. Rees, Testing matrix groups for primitivity, J. Algebra 184 (1996), 795.
28. [Hu] B. Huppert, Linear auflösbare Gruppen, Math. Z. 67 (1957), 479-518.
29. [IY] R. Impagliazzo and M. Yung, Direct minimum-knowledge computations, in "Advances in Cryptology: CRYPTO '87 Proceedings," Lecture Notes in Computer Science, Vol. 293, pp. 40-51, Springer-Verlag, Berlin, 1988.
30. [KLi] R. Kannan and R. Lipton, Polynomial-time algorithms for the orbit problem, J. Assoc. Comput. Mach. 33, No. 4 (1986), 808-821.
31. [KLu] W. M. Kantor and E. M. Luks, Computing in quotient groups, in "Proc. 22nd ACM STOC, 1990," pp. 524-534.
32. [LSZ] R. Lipton, L. Snyder, and Y. Zalcstein, Complexity of the word and isomorphism problems for finite groups, in "Proc. Conf. Info. Sciences and Systems, 1976," John Hopkins University, pp. 33-35.
33. [LZ] R. Lipton and Y. Zalcstein, Word problems solvable in logspace, J. Assoc. Comput. Mach. 24 (1977), 522-526.
34. [Lu82] E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. System Sci. 25 (1982), 42-65.
35. [Lu87] E. M. Luks, Computing the composition factors of a permutation group in polynomial time, Combinatorica 7 (1987), 87-99.
36. [Lu92] E. M. Luks, Computing in solvable groups, in "Proc. 33rd IEEE FOCS, 1992," pp. 111-120.
37. [Lu93] E. M. Luks, Permutation groups and polynomial-time computation, in "Groups and Computation," pp. 139-175, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 11, Amer. Math. Soc., Providence, RI, 1993.
38. [M] S. Magliveras, A crypotosystem from logarithmic signatures of finite groups, in "Proc. 29th Midwest Symposium on Circuits and Systems (1986)," pp. 972-975.
39. [MM89] S. Magliveras and N. Memon, Properties of Cryptosystem PGM, in "Advances in Cryptology-CRYPTO '89," Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, Berlin, 1989, 447-460.
40. [MM92] S. Magliveras and N. Memon, Algebraic properties of cryptosystem PGM, J. Cryptology 5 (1992), 167-183.
41. [Mih] K. A. Mihaǐlova, The occurrence problem for a direct product of groups, Dokl. Akad. Nauk 119 (1958), 1103-1105. [in Russian]
42. [Mil] J. Milnor, Growth of finitely generated solvable groups, J. Differential Geometry 2 (1968), 447-449.
43. [NP] P. M. Neumann and Cheryl E. Praeger, A recognition algorithm for the special linear groups, Proc. London Math. Soc. 65 (1992), 555-603.
44. [New] M. Newman, "Integral Matrices," Pure and Applied Mathematics, Vol. 45, Academic Press, New York, 1972.
45. [Os] G. Ostheimer, Ph.D. thesis, Mathematics Dept., Rutgers University, 1996.
46. [Sch+] M. Schönert et al., "GAP - Groups, Algorithms, and Programming," Lehrstuhl D für Mathematik, Rheinisch Westfälische Technische Hochschule, Aachen, Germany, 1992.
47. [Schr] A. Schrijver, "Theory of Linear and Integer Programming," Wiley, New York, 1986.
48. [Si1] C. C. Sims, Computation with permutation groups, in "Proc. Second Symposium on Symbolic and Algebraic Manipulation" (S. R. Petrick, Ed.), pp. 23-28, ACM, New York, 1971.
49. [Si2] C. C. Sims, "Computation with finitely presented groups," Cambridge Univerity Press, New York, 1994.
50. [Su63] D. Suprunenko, "Soluble and Nilpotent Linear Graphs," Transl. Math. Monographs, Vol. 9, Amer. Math. Soc., Rhode Island, 1963.
51. [Su76] D. Suprunenko, "Matrix Groups," Transi, of Math. Monographs, Vol. 45, Amer. Math. Soc., Rhode Island, 1976.
52. [Ti] J. Tits, Free subgroups in linear groups, J. Algebra 20 (1972), 250-270.
53. [We] B. A. F. Wehrfritz, "Infinite Linear Groups," Ergeb. Math. Grenzgeb., Vol. 76, Springer-Verlag, Berlin, 1973.
54. [Wo] J. A. Wolf, Growth of finitely generated solvable groups and curvature of Riemannian manifolds, J. Differential Geometry 2 (1968), 421-446.
55. [Za] H. Zassenhaus, Beweis eines Satzes über diskrete Gruppen, Abh. Math. Sem. Univ. Hamburg 12 (1938), 289-312.