Computing normalizers in permutation p-groups

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing normalizers in permutation p-groups

Full text

Pdf (711 KB)

Source

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

Oxford, United Kingdom

Pages: 139 - 146

Year of Publication: 1994

ISBN:0-89791-638-7

Authors

Eugene M. Luks	Computer and Information Science, University of Oregon
Ferenc Rákóczi	Computer and Information Science, University of Oregon
Charles R. B. Wright	Department of Mathematics, University of Oregon

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): 11, Citation Count: 2

Additional Information:

references cited by 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/190347.190390 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.

	At	M.D. Atkinson, An algorithm for finding the blocks of a permutation group, Math. Comp., 29 (1975), 911-9a3.
	BC	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]
	Bu	G. Butler, Computing normalizers in permutation groups, J. Algorithms, 4 (1983), 163-175.
	CP	J. Cannon and C. Playoust, An Introduction to MAGMA, School of Mathematics and Statistics, U. of Sydney, 1993.
	GHLSW	Zvi Galil , Christoph M. Hoffmann , Eugene M. Luks , Claus P. Schnorr , Andreas Weber, An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs, Journal of the ACM (JACM), v.34 n.3, p.513-531, July 1987 [doi>10.1145/28869.28870]
	GS	S. P. Glasby , Michael C. Slattery, Computing intersections and normalizers in soluble groups, Journal of Symbolic Computation, v.9 n.5-6, p.637-651, May/June 1990 [doi>10.1016/S0747-7171(08)80079-X]
	Ho	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]
	KL	W. M. Kantor , E. M. Luks, Computing in quotient groups, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.524-534, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100290]
	Kn	D.E. Knuth, Notes on efficient representation of perm groups, Combinatorica, 11 (1991), 57-68.
	Lu1	E.M. Luks, Parallel algorithms for permutation groups and graph zsomorphism, Proc. 27th IEEE FOCS, 1986, 292-302.
	Lu2	E.M. Luks, Computing in solvable matrix groups, Proc. 33rd IEEE Symp. on the Foundations of Comp. Sci., 1992, 111-120.
	Lu3	E.M. Luks, Permutation groups and polynomialtime computation, in Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 11, Amer. Math. Soc, 1993, ed. L. Finkelstein and W. Kantor, 139-175.
	LM	Eugene M. Luks , Pierre McKenzie, Parallel algorithms for solvable permutation groups, Journal of Computer and System Sciences, v.37 n.1, p.39-62, August 1988 [doi>10.1016/0022-0000(88)90044-X]
	Sc	M. SchSnert et al., GAP, Groups, Algorithms and Programming, Lehrstuhl D fiir Mathematik, Rheinisch Westf~1ische Technische Hochschule, Aachen, Germany, 3ra edition, 1993.

CITED BY 2

	Eugene M. Luks , Takunari Miyazaki, Polynomial-time normalizers for permutation groups with restricted composition factors, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.176-183, July 07-10, 2002, Lille, France
	Ferenc Rákóczi, Fast recognition of the nilpotency of permutation groups, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.265-269, July 10-12, 1995, Montreal, Quebec, Canada