Computing normal subgroups

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing normal subgroups

Full text

Pdf (211 KB)

Source

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

Rostock, Germany

Pages: 194 - 198

Year of Publication: 1998

ISBN:1-58113-002-3

Author

Alexander Hulpke

School of Mathematical and Computational Sciences, University of St. Andrews, The North Haugh, St. Andrews, Fife KY16 9SS, United Kingdom

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
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): 9, Downloads (12 Months): 15, Citation Count: 1

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/281508.281612 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	BABAI, L., GOODMAN, A. J., KANTOR, W. M., LUKS, E., AND P J~LFY, P. P. Short presentations for finite groups. J. Algebra 19~ (1997), 97-112.
	2	BRAY, J. Symmetric Presentations of Sporadic Groups and Related Topics. PhD thesis, The University of Birmingham, 1997.
	3	John J. Cannon , Derek F. Holt, Computing chief series, composition series and socles in large permutation groups, Journal of Symbolic Computation, v.24 n.3-4, p.285-301, Sept./Oct. 1997 [doi>10.1006/jsco.1997.0127]
	4	CANNON, J. J. Construction of defining relators for finite groups. Discrete Math. 5 (1973), 105-129.
	5	CELLER, F., NEUB{ISER, J., AND WRIGHT, C. R. B. Some remarks on the computation of complements and normalizers in soluble groups. Acta Appl. Math. 21 (1990), 57-76.
	6	DIXON, J. D., AND MORTIMER, B. Permutation Groups, vol. 163 of Graduate Texts in Mathematics. Springer, Heidelberg, 1996.
	7	EASDOWN, D., AND PRAEGER, C. E. On minimal faithful permutation representations of finite groups. Bull. Austral. Math. Soc. 38 (1988), 207-220.
	8	FEIT, W., AND THOMPSON, J. G. Solvability of groups of odd order. Pacific J. Math. 13 (1963), 775-1029.
	9	THE GAP GROUP. GAP- Groups, Algorithms, and Programming, Version ~. Lehrstuhl D fiir Mathematik, RWTH Aachen, Germany and School of Mathematical and Computational Sciences, U. St. Andrews, Scotland, 1997.
	10	HULPKE, A. Computing subgroups invariant under a set of automorphisms, submitted ().
	11	HULPKE, A. Konstruktion transitiver Permutationsgruppen. PhD thesis, Rheinisch-Westf/ilische Technische Hochschule, Aachen, Germany, 1996.
	12	ISAACS, I. M., KANTOR, W. M., AND SPALTENSTEIN, N. On the probability that a group element is psingular. J. Algebra 176, 1 (1995), 139-181.
	13	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]
	14	KANTOR, W. M., AND SERESS, Jr. Permutation group algorithms via black box recognition algorithms. In Groups '97 Bath/St. Andrews (to appear), C. M. Campbell, E. F. Robertson, and G. C. Smith, Eds., Cambridge University Press.
	15	LINTON, S. A. The art and science of computing in large groups. In Proceedings of CANT '92 (1995), W. Bosma and A. J. van der Poorten, Eds., Kluwer, pp. 91-109.
	16	Klaus Lux , Jürgen Müller , Michael Ringe, Peakword condensation and submodule lattices: an application of the meat-axe, Journal of Symbolic Computation, v.17 n.6, p.529-544, June 1994 [doi>10.1006/jsco.1994.1033]
	17	NEUMANN, P. M. Some algorithms for computing with finite permutation groups. In Groups - St. Andrews 1985 (1986), E. F. Robertson and C. M. Campbell, Eds., Cambridge University Press, pp. 59-92.
	18	PARKER, R. The Computer Calculation of Modular Characters (the MeatAxe). In Computational Group theory (1984), M. D. Atkinson, Ed., Academic press, pp. 267-274.
	19	SERESS, A. Nearly linear time algorithms for permutation groups: an interplay between theory and practice. Acta Appl. Math. (1998), to appear.