An elementary algorithm for computing the composition factors of a permutation group

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An elementary algorithm for computing the composition factors of a permutation group

Full text

Pdf (830 KB)

Source

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

Kiev, Ukraine

Pages: 127 - 134

Year of Publication: 1993

ISBN:0-89791-604-2

Author

Robert Beals

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 18, 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/164081.164105 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.

	Atk	M.D. Atkinson: An algorithm for finding the blocks of a permutation group, Math. Comp. 29 (1975), pp. 911-913.
	Ba	L. Babai: Computational Complexity in Finite Groups, Proc. InternationM Congress of Mathematicians Kyoto 1990, Springer-Verlag, Tokyo 1991.
	BBR	László Babai , Robert Beals , Daniel Rockmore, Deciding finiteness of matrix groups in deterministic polynomial time, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.117-126, July 06-08, 1993, Kiev, Ukraine [doi>10.1145/164081.164104]
	BCFLS	László Babai , Gene Cooperman , Larry Finkelstein , Eugene Luks , Ákos Seress, Fast Monte Carlo algorithms for permutation groups, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.90-100, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103435]
	BCFS	László Babai , Gene Cooperman , Larry Finkelstein , Ákos Seress, Nearly linear time algorithms for permutation groups with a small base, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.200-209, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120724]
	BKL	L. Babai, W. M. Kantor, E. M. Luks: Computational complexity and the Classification of Finite Simple Groups, Proc 24th IEEE FOCS (1983), pp. 162-171.
	BLS1	L. Babai , E. Luks , A. Seress, Permutation groups in NC, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.409-420, January 1987, New York, New York, United States [doi>10.1145/28395.28439]
	BLS2	L. Babai, E. Luks, A. Seress" Fast management of permutation groups, Proc. 28th IEEE FOCS (1988), pp. 272-282.
	BLS3	L. Babai, E. M. Luks, /i. Seress: Fast deterministic management of permutation groups, in preparation.
	Be	R. Beals: Computing blocks of imprimitivity for small-base groups in nearly linear time, to appear in Proc. DIMACS Workshop on Groups and Computation.
	BB	R. Beals, L. Babai: Las Vegas algorithms for matrix groups, in preparation.
	BS	Robert Beals , Ákos Seress, Structure forest and composition factors for small base groups in nearly linear time, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.116-125, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129724]
	Cam	P. J. Cameron: Finite permutation groups and finite simple groups, But1. London Math Soc. 13 (1981), pp. 1-22.
	CF	G. Cooperman, L. Finkelstein: Personal communication.
	CFL	G. Cooperman , L. Finkelstein , E. Luks, Reduction of group constructions to point stabilizers, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.351-356, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74581]
	FHL	M. L. Furst, J. Hopcroft, E. M. Luks: Polynomial-time algorithms for permutation groups, in: 21st IEEE FOCS, 1980, pp. 36-41.
	Go1	D. Gorenstein: Finite Simple Groups--An introduction to their classification, Plenum Press, New York (1982).
	Go2	D. Gorenstein: The Enormous Theorem, Scientific American 253 (December 1!)85), pp. 104-114.
	Hup	B. I-Iuppert: EndIich Gruppen I, Grundlehren der mathematischen Wissenschaften 134, Springer-Verlag, Berlin, 1982.
	Je	Mark Jerrum, A compact representation for permutation groups, Journal of Algorithms, v.7 n.1, p.60-78, March 1986 [doi>10.1016/0196-6774(86)90038-6]
	Ka	W. M. Kantor: Sylow's Theorem in Polynomial Time, JCSS 30 (1985), pp. 359-394.
	Kn	D. E. Knuth: Efficient representations of perm groups, Combinatorica 11 (1991), pp. 57-68 (preliminary version circulated since 1981).
	Lu1	E. M. Luks: Parallel Algorithms for Permutation Groups and Graph Isomorphism, Proc 27th IEEE FOCS (1986), pp. 292-302.
	Lu2	E. M. Luks, Computing the composition factors of a permutation group in polynomial time, Combinatorica, v.7 n.1, p.87-99, Jan. 1987 [doi>10.1007/BF02579204]
	Lu3	E. M. Luks: Computing in Solvable Matrix Groups, Proc. 33rd IEEE FOCS (1992), pp. 111- 120.
	LS	E. M. Luks, /~ Seress' personal communication.
	Si	Charles C. Sims, Computation with permutation groups, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.23-28, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806264]
	Wi	H. Wielandt: Finite Permutation Groups, Acad. Press, New York 1964.