Experimental comparison of algorithms for Sylow subgroups

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Experimental comparison of algorithms for Sylow subgroups

Full text

Pdf (852 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents

Berkeley, California, United States

Pages: 251 - 262

Year of Publication: 1992

ISBN:0-89791-489-9

Author

Greg Butler

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 20, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/143242.143324 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Atkinson, M.D. (1984): Computational Group Theory, Academic Press, London, 1984.
	2	Atkinson, M.D., and Neumann, P.M. (1990): Computing Sylow subgroups of permutation groups, (Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, February 1990), Congressus Numerantium, 79, 55-60.
	3	Butler, G. (1979): Computational Approaches to Certain Problems in the Theory of Finite Groups, Ph.D. thesis, University of Sydney.
	4	G Butler, Effective computation with group homomorphisms, Journal of Symbolic Computation, v.1 n.2, p.143-157, June 1985 [doi>10.1006/jsco.1993.1011]
	5	Butler, G. (1986): Data structures and algorithms for cyclically eztended Schreier vectors, Congressus Numerantium, 52 , 63-78.
	6	Butler, G. (1990), Computing a condigioued pc presentation of a soluble permugagiou group, TR 392, Basser Department of Computer Science, University of Sydney, 5 pages.
	7	Gregory Butler, Implementing Some Algorithms of Kantor, Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.82-93, October 07-11, 1991
	8	Butler, G. (1991): Fundamental Algorithms for Permutation Groups, Lecture Notes in Computer Science 559, Springer-Verlag, Heidelberg, (xii)+238 pages.
	9	Butler, G., and Cannon, J.J. (1984): Using homomorphisms ~o compute Sylow subgroups of permuta~iort groups, TR 222, Basser Department of Computer Science, University of Sydney.
	10	G. Butler , J. Cannon, Computing in permutation and matrix groups III: slow subgroups, Journal of Symbolic Computation, v.8 n.3, p.241-252, Sep. 1989 [doi>10.1016/S0747-7171(89)80068-9]
	11	Greg Butler , John J. Cannon, On Holt's algorithm, Journal of Symbolic Computation, v.15 n.2, p.229-233, Feb. 1993 [doi>10.1006/jsco.1993.1016]
	12	Gregory Butler , John Cannon, Computing Sylow subgroups of permutation groups using homomorphic images of centralizers, Journal of Symbolic Computation, v.12 n.4-5, p.443-457, Oct./Nov. 1991 [doi>10.1016/S0747-7171(08)80097-1]
	13	Cannon, J.J (1971): Compting loca structure of large finite groups, Computers in Algebra and Number Theory, G. Birkhoff and M. Hall, Jr (eds), (SIAM-AMS Proceedings, Vol. 4), American Mathematical Society, Providence, R.I., pp. 161- 176.
	14	Cannon, J.J. (1984): An introduction ~o the group theory language, Cayley, in {1}, pp.145-183.
	15	S. P. Glasby, Constructing normalisers in finite soluble groups, Journal of Symbolic Computation, v.5 n.3, p.285-294, June 1988 [doi>10.1016/S0747-7171(88)80030-0]
	16	Hall, Jr, M. (1959): The Theory of Groups, Macmillan, New York.
	17	Holt, D.F. (1984): A computer program for the calculation of the Schur multiplier of a permutation group, in {1}, pp. 307-319.
	18	D. F. Holt, The computation of normalizers in permutation groups, Journal of Symbolic Computation, v.12 n.4-5, p.499-516, Oct./Nov. 1991 [doi>10.1016/S0747-7171(08)80100-9]
	19	Huppert, B. (1967): Endllche Gruppen I, Springer-Verlag, Berlin.
	20	Kantor, W.M. (1985): Polynomial-time algorithms for finding elements of prime order and Sylow subgroups, J. Algorithms, 6, 478-514.
	21	W. M. Kantor , D. E. Taylor, Polynomial-time versions of Sylow's theorem, Journal of Algorithms, v.9 n.1, p.1-17, March 1988 [doi>10.1016/0196-6774(88)90002-8]
	22	Kantor, W.M. (1985): Sylow's theorem in polynomial-time, J. Comput. Syst. Sci., 30~ 359- 394.
	23	Kantor, W.M. (1988): Algorithms for Sylow psubgroups and solvable groups, Computers in Algebra, M.C. Tangora (ed.), Marcel Dekker, New York, pp.77-90.
	24	K .to , W.M. (1989): u.publi h d not~ .
	25	Leon, J.S. (1980): On an algorithm for finding a base and s~rong generating set for a group given by generating permu~aiions, Math. Comp., 35~ pp.941-974.
	26	Jeffrey S. Leon, Permutation group algorithms based on partitions, I: theory and algorithms, Journal of Symbolic Computation, v.12 n.4-5, p.533-583, Oct./Nov. 1991 [doi>10.1016/S0747-7171(08)80103-4]
	27	Neumann, P.M. (1986): Some algorithms for computing wi~h permutation groups~ Groups- St Andrews 1985, E.F. Robertson and C.M. Campbell (eds), London Mathematics Society Lecture Notes 121~ Cambridge University Press, Cambridge, pp. 59-92.
	28	Charles C. Sims, Computing the order of a solvable permutation group, Journal of Symbolic Computation, v.9 n.5-6, p.699-705, May/June 1990 [doi>10.1016/S0747-7171(08)80083-1]
	29	Wielandt, H. (1964): Finite Permutation Groups, Academic Press, New York.