A polycyclic quotient algorithm

Journal of Symbolic Computation

Volumn 25, Issue 1, 1998, Pages 61-97

  Lo, Eddie H ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (36)

1. Baumslag, G., Cannonito, F.B., Miller III, C.F. (1981a). Computable algebra and group embeddings, J. Algebra 69, 186-212.
2. Baumslag, G., Cannonito, F.B., Miller III, C.F. (1981b). Some recognizable properties of solvable groups, Math. Z. 178, 289-295.
3. Bayes, A.J., Kautsky, J., Wamsley, J. (1974). Computation in nilpotent groups (application). In M. F. Newman (ed) Proc. 2nd Int. Conf. on Theory Groups, Lecture Notes in Mathematics 372, Springer, Berlin, pp. 82-89
4. Becker, T., Weispfenning, V. (1991). Gröbner Bases: a Computational Approach to Commutative Algebra, Springer, Berlin.
5. Bosma, W., Cannon, J. (1996). Handbook of Magma functions. Computer Algebra Group, University of Sydney.
6. Felsch, V. (1976). A machine independent implementation of a collection algorithm for the multiplication of group elements. In R.D. Jenks (ed), SYMSAC 76, Proc. 1976 ACM Symp. Symbolic and Algebraic Computation, Assoc. Comput. Mach., New York, pp. 159-166
7. Gebauer, R., Möller, H.M. (1988). On an installation of Buchberger's algorithm, J. Symbolic Comput. 6, 275-286.
8. Hall, Jr. M. (1959). The Theory of Groups, Macmillan, New York.
9. Havas, G., Kenne, P., Richardson, J., Robertson, E. (1984). A Tietze transformation program. In M.D. Atkinson (ed) Computational Group Theory, Academic, New York, pp. 69-73.
10. Havas, G., Newman, M.F. (1980). Application of computers to questions like those of Burnside. In J.L. Mennicke (ed) Burnside Groups, Lecture Notes in Mathematics 806, Springer, Berlin, pp. 211-230.
11. Havas, G., Nicholson, T. (1976). Collection. In R.D. Jenks (ed) SYMSAC '76, Proc. 1976 ACM Symp. Symbolic and Algebraic Computation, Assoc. Comput. Mach. New York, pp. 9-14.
12. Havas, G., Robertson, E. (1994). Application of computational tools for finitely presented groups. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15, 29-39.
13. Huynh, D.T. (1986). The complexity of the membership problem for two subclasses of polynomial ideals, SIAM J. Comput. 15, 581-594.
14. Kharlampovič, O.G. (1981). A finitely presented soluble group with insoluble word problem, Izv. Akad. Nauk. Ser. Mat. 45, 852-873.
15. Laue, R, Neubuser, J., Schoenwaelder, U. (1984). Algorithms for finite soluble groups and the SOGOS system. In Michael D. Atkinson (ed) Proceedings of the London Math. Soc. Symp. on Computational Group Theory, Academic, London, pp. 105-135.
16. Leedham-Green, C.R., Soicher, L.H. (1990). Collection from the left and other strategies, J. Symbolic Comput. 9, 665-675.
17. Lo, E. (1995). A polycyclic quotient algorithm. Proceedings of the DIMACS Workshop on Groups and Computation, to appear.
18. Lo, E. (1996a). A Polycyclic Quotient Algorithm, PhD thesis, Rutgers University.
19. Lo, E. (1996b). Using the Polycyclic Quotient Algorithm Program pcqa, Department of Mathematics, Rutgers University, New Jersey ftp@math.rutgers.edu.
20. Macdonald, I.D. (1973). Computer results on Burnside groups, Bull. Australian Math. Soc. 9, 433-438.
21. Macdonald, I.D. (1974). A computer application to finite p-groups, J. Australian Math. Soc. 17, 102-112.
22. Möller, H.M., Mora, T. (1984). Upper and lower bounds for the degree of Gröbner bases. In EUROSAM '84, International Symposium on Symbolic and Algebraic Computation, Springer, Berlin, pp. 172-183.
23. Neubuser, J. (1982). An elementary introduction to coset table methods in computational group theory. In C.M. Cambell and E.F. Robertson (ed), Groups St Andrews 1981, LMS Lecture Notes 71, Cambridge University Press, Cambridge, pp. 1-45.
24. Newman, M.F. (1976). A computer aided study of a group defined by fourth powers, Bull. Australian Math. Soc. 14, 293-297.
25. Nickel, W. (1994). Computing nilpotent quotients of finitely presented groups, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 25, 175-191.
26. Niemeyer, A.C. (1994). A finite soluble quotient algorithm, J. Symbolic Comput. 18, 541-561.
27. Ostheimer, G. (1996). Algorithms for Polycyclic-by-finite Groups. PhD thesis, Rutgers University.
28. Plesken, W. (1987). Towards a solvable quotient algorithm, J. Symbolic Comput. 4, 111-122.
29. Schönert, M. et al. (1996). GAP-Groups, Algorithms and Programming, Lehrstuhl D für Mathematik, Rheinisch-Westfälische Technicsche Hochschule, Aachen. Computer Program.
30. Sims, C.C. (1987). Verifying nilpotence, J. Symbolic Comput. 3, 231-247.
31. Sims, C.C. (1990). Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm, J. Symbolic Comput. 9, 707-723.
32. Sims, C.C. (1994). Computation with Finitely Presented Groups, Cambridge University Press, Cambridge.
33. Tietze, H. (1908). Ueber die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten, Monatsh. für Math. und Phys. 19, 1-118.
34. Vaughan-Lee, M.R. (1990). Collection from the left, J. Symbolic Comput. 9, 725-733.
35. Wamsley, J. (1974). Computation in nilpotent groups (theory). In M.F. Newman (ed) Proc. Second Internat. Conf. Theory Groups, Berlin, Springer, pp. 691-700.
36. Wegner, A. (1992). The Construction of Finite Soluble Factor Groups of Finitely Presented Groups and its Application, PhD thesis, St. Andrews.