Computers in group theory

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computers in group theory: a survey

Full text

Pdf (1.25 MB)

Source

Communications of the ACM archive
Volume 12 , Issue 1 (January 1969) table of contents

Pages: 3 - 12

Year of Publication: 1969

ISSN:0001-0782

Author

John J. Cannon

Univ. of Sydney, Australia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 31, Downloads (12 Months): 86, Citation Count: 5

Additional Information:

abstract 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/362835.362837 What is a DOI?

ABSTRACT

Computers are being applied to an increasingly diverse range of problems in group theory. The most important areas of application at present are coset enumeration, sub-group lattices, automorphism groups of finite groups, character tables, and commutator calculus. Group theory programs range from simple combinatorial or numerical programs to large symbol manipulation systems. In this survey the more important algorithms in use are described and contrasted, and results which have been obtained using existing programs are indicated. An extensive bibliography is included.

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	AIZENBERG, N. N., LETICEVSKII, A. A. {LETICEVSKII, O. A.{ On computing on "ECM" representations of wreathproducts of finite groups. Kibernetika (Kiev) 3 (1965), 63-71. (In Russian)
	2	BANDLER, P.A. M.A. Th., U. of Manchester, 1956.
	3	BENSON, C. T., AND MENDELSOHN, N. S. A calculus for a certain class of word problems in groups. J. Combinatorial Theory 1, 2 (Sept. 1966), 202-208.
	4	BERNSTEIN, H. J., MOLLER, O., AND RAPAPORT, E. S. Machine factorization of groups. Math. Algorithms 1, 3 (July, 1966), 39-51.
	5	BIRCH, B. J., AND SVINNERTON-DYER, H. P .F . See eh. by Swinnerton-Dyer in Algebraic Number Theory, Cassels and Frohlich (Eds.), Academic Press, New York, 1967.
	6	BIVINS, I. L., METROPOLIS, N., STEIN, P. R., AND WELLS, M.B., Characters of the symmetric groups of degree 15 and 16. Math. Tables 8, 48 (Oct. 1954), 212-215.
	7	BROTT, C., Ein Programm zur Bestimmung absolut irreduzibler Charaktere und Darstellungen endlicher Gruppen. Diplomarbeit, U. of Kie}, 1966.
	8	--, AND NEUBUSER, J. A program for the calculation of characters and representations of finite groups. Proc. Conf. on Comput. Algebra, Oxford, Aug., 1967, Pergamon, New York, 1968.
	9	BOLOW, R. Eine Ableitung der Kristallklassen im R4 mit Hilfe gruppentheoretischer Programme. Diplomarbeit, U. of Kiel, 1967.
	10	, AND NEUBUSER, J. On some applications of group theoretical programmes to the derivation of the crystal classes of R4. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	11	CAMPBELL, J. M., AND LAMBERTH, W.J. Symbolic and numeric computation in group theory. Proc. of Aust. Comput. Soe. Conf., Canberra, Aug. 1966, 4 pp.
	12	CANNON, J. A program for the determination of the subgroup lattice and subgroup defining relations of a finite group. Dep. of Pure Math., U. of Sydney, 1966, 20 pp. (Unpublished)
	13	--. Some combinatorial and symbol manipulation programs in group theory. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	14	COMT, S. On the machine calculation of characters of the symmetric group. Comptes Rendus, 12th Cong. Math. Seand. Lund, 1953, pp. 18-23.
	15	-- Uber die Anwendung yon Binarmodellen in der Theorie der Charaktere der symmetrischen Gruppen. Numer. Math. 1, (1959), 99-109.
	16	Improved methods to calculate the characters of the symmetric group. Math. Comput. 14, (1960), 104--117.
	17	DixoN, J .D . High speed computation of group characters. Numer. Math. 10 (1967), 446--450.
	18	ELTERMANN, M. Mitt. d. Rh. Westf. Inst. f. Instr. Math. (Bonn) 2 (1963), 105-108.
	19	FELSCH, H. Die Behandlung zweier Gruppen theoretischer Verfahren auf elektronischeu Rechenmaschinen. Diplomarbeit, U. of Kiel, 1960.
	20	--. Programmierung der Restklassenabzahlung einer Gruppe nach Untergruppen. Numer. Math. 3 (1961), 250- 256.
	21	--, NEUBUSER, J., AND RUMBERGER, R. Gewinnung einer Permutationsdarstellung einer Gruppe aus Definierenden Relationen. Mitt. d. Rh. Westf. Inst. f. Instr. Math. (Bonn) 2 (1963), 75-104.
	22	FELSCH, V. Eiu Programm zur Berechnung des Untergruppenverbandes einer endlichen Gruppe. Diplomarbeit, U. of Kiel, 1963.
	23	___, AND NEUBi)SER, J. Ein Programm zur Bereehnung des Untergruppenverbandes einer endliehen Gruppe. Mitt. d. Rh. Westf. Inst. f. Instr. Math. (Bonn) 2 (1963), 39-74.
	24	, AND --. On a program for the determination of the automorphism group of a finite group. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	25	--, AND --, Uber ein Programm zur Bereehnung der Automorphistengruppe einer endlichen Gruppe. Numcr. Math. 11 (1968), 277-292.
	26	FERBER, K., AND JRGENSEN, i . A program for the drawing of lattices. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	27	GERHARDS, L., AND LINDENBERG, W. Ein Verfahren zur Berechnung des vollstandigen Untergruppenverbandes endlieher Gruppen auf Dualmaschinen. Numer. Math. 7 (1965), 1-1O.
	28	--, AND ALTMANN, E. A computational method for determining the automorphism group of a finite soluable group. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	29	GuY, M. J .T . Coset enumeration. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967.
	30	HALL, M. A search for simple groups of order less than one million. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	31	I-IENNEMAN, W. Note on an algebraic substructure algorithm. Math. Algorilhms 1, 2 (Apr. 1966), 40.
	32	JAMES, R., AND CANNON, J. The computation of isomorphism classes of p-groups. Math. Comput. (Jan. 1969) (to appear).
	33	JURGENSEN, H. Calculation with the elements of a group given by generators and defining relations. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	34	KRAUSE, E., AND WESTON, I. The restricted Burnside group of exponent 5. AMS Not. 15, 3 (Apr. 1967), 416.
	35	--, AND --. An algorithm related to the restricted Burnside group of prime exponent. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	36	LEECH, J. Some definitions of Klein's simple group of order 168 and other groups. Proc. Glasgow Math. Assoc. 5 (1962), 166-175.
	37	--. Coset enumeration on digital computers. Proc. Cambridge Phil. Soc. 59 (1963), 257-267.
	38	Generators for certain normal subgroups of (2, 3, 7). Proc. Cambridge Phil. Soc. 61 (1965), 321-332.
	39	--. Coset enumeration. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	40	LINDENBERG, W. Uber die Darstellung yon Gruppenelementen in digitalen Rechenautomaten. Numer. Math. 4 (1962), 151-153.
	41	Die Struktur eines Ubersetzungsprogramms zur Multiplikation von Gruppcnelementcn in digitalen Rechenautomaten. Mitt. d. Rh. Westf. Inst. f. Instr. Math. (Bonn) 2 (1963), 1-38.
	42	---, AND GERHARDS, L. Combinatorial construction by computer of the set of all subgroups of a finite group by composition of partial sets of its subgroups. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	43	LIULEVICIUS, A. Coalgebras, resolutions, and the computer, Part 1. Math. Algorithms 1, 1 (Jan. 1966), 4-11.
	44	--. Coalgebras, resolutions, and the computer, Part 2. Math. Algorithmns 1, 2 (Apr. 1966), 2-10.
	45	McKAY, J. K. S. Algorithm 307. Comm. ACM 10, 7 (July 1967), 450--451.
	46	--. Remark onAlgorithm 307. Comm.ACM 11 (Jan. 1968) 14.
	47	___ The construction of the character table of a finite group from generators and relations. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	48	--. A method for computing the character table of a finite group. Computers in Mathematical Research, Churchhouse, R. F. and Herz, J. C. (Eds.), North-Holland Pub. Co., Amsterdam, 1968, pp. 140-148.
	49	MADDISON, R. Dipl. diss. U. Math. Lab., Cambridge, 1958.
	50	MAURER, W. D. Computer experiments in finite groups. Brown U., Providence, R.I., 1965, 30 pp. (Unpublished)
	51	Computer experiments in finite algebra. Proj. MAC, MIT Memo. MAC-M-246, Cambridge, Mass., 1965, 17 pp.
	52	Computer experiments in finite algegra II. Proj. MAC, MIT Memo. MAC-M-282, Cambridge, Mass., 1965, 39 pp.
	53	An algebraic substructure algorithm. Math. Algorithms 1, 1 (Jan. 1966), 72-86.
	54	Ward Douglas Maurer, Computer experiments in finite algebra, Communications of the ACM, v.9 n.8, p.598-603, Aug. 1966 [doi>10.1145/365758.365783]
	55	___ The uses of computers in Galois theory. Proc. Conf. on omput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	56	MENDELSOHN, N. S. An :algorithmic solution for a word problem in group theory. Can. J. Math. 16 (1964), 509-516. Correction to: An algorithmic solution for a word problem in group theory. Can. J. Math. 17 (1965), 505.
	57	--. Defining relations for subgroups of finite index of groups with a finite presentation. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	58	Some examples of man-machine interaction in the solution of mathematical problems. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	59	M0SER, W. On the Todd-Coxeter and Reidemeister-Schreier methods. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967.
	60	NEUBiSER, J. Untcrsuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteuerten Dualmaschine. Numer. Math. 2 (1960), 280-292.
	61	____Bestimmung dcr Untergruppenverbande endlicher p-Gruppcn auf einer prograinmgesteuerten elektronischen Dualmaschine. Numer. Math. 3 (1961), 271-278.
	62	--. Die Untergruppen-verbinde der Gruppen der Ordnungen _<100 mit Ausnahme der Ordnungen 64 and 96. Habilitationsschrift, U. of Kiel, 1967.
	63	--. Investigation of finite groups on computers. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	64	L. M. Norton, ADEPT. A HEURISTIC PROGRAM FOR PROVING THEOREMS OF GROUP THEORY, Massachusetts Institute of Technology, Cambridge, MA, 1966
	65	PARKER, E. W., AND NIKOLAI, P .J . A search for analogues of the Mathieu groups. Math. Tables 12, 61 (Jan. 1958), 38-43.
	66	PINKERTON, T. An algorithm for the automatic computation of integral homology groups, Pt. I. Math. Algorithms 1, 1 (Jan. 1966), 27-44.
	67	--. An algorithm for the automatic computation of integral homology groups, Part II. Math. Algorithms 1, 2 (Apr. 1966), 33-39.
	68	RUUD, P. G., AND KEOWN, E.R. Representations of groups of order 32. AMS Notices, 14, 2 (Feb. 1967), 281.
	69	--, AND --. The computation of irreducible representations of finite groups of order 2% n < 6. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	70	SEGOVIA, R., AND MCINTOSH, H. Computer analysis of finite groups. Instituto Politecnico, Nacional, Escuela, Superior de Fisica y Mathematicas, Mexico, 32 pp. (Unpublished)
	71	SIMs, C.C. Computational methods in the study of permutation groups. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	72	SMITh, D.A. A basis algorithm for finitely generated abelian groups. Math. Algorithms 1, 1 (Jan. 1966), 13-26.
	73	TRITTER, A.L. A module-theoretic computation related to the Burnside problem. Proc. Conf. on Comput. Algebra, Oxford, Aug. 1967, Pergamon, New York, 1968.
	74	TnOTTER, H .F . A machine program for coset enumeration. Can. Math. Bull. 7, 3 (July 1964), 357-368.
	75	--. A program for the Coxeter-Todd algorithm for the enumeration of cosets in groups. Math. Algorithms 1, 3 (July 1966), 12-18.
	76	--. Correction to the algorithm: A program for the Coxeter- Todd algorithm for the enumeration of cosets in groups. Math. Algorithms 2 (1967), 212.
	77	Wos, L., CARSON, D., AND ROBINSON, C. The unit preference strategy in theorem proving. Proc. AFIPS 1964 Fall Joint Comput. Conf., Vol. 26, Spartan Books, New York, pp. 615--621.
	78	YATES, R. Group analysis programs. Program Note 5, Quantum Theory Proj. U. of Florida, Gainesville, Fla., 1963.

CITED BY 5

	John Grover , Lawrence A. Rowe , Darrell Wilson, Applications of coset enumeration, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.183-187, March 23-25, 1971, Los Angeles, California, United States
	Clayton V. Aucoin, Computer Science And Graduate Education In Applied Mathematics, Proceedings of the 1978 annual conference, p.132-137, December 04-06, 1978, Washington, D.C., United States
	Stig Flodmark , Esko Blokker, Use of computers in treating nonnumerical mathematics and group theoretical problems in physics, ACM SIGSAM Bulletin
	Robert J. Plemmons, A survey of computer applications to semigroups and related structures, ACM SIGSAM Bulletin
	R. J. Lipton , S. C. North , J. S. Sandberg, A method for drawing graphs, Proceedings of the first annual symposium on Computational geometry, p.153-160, June 05-07, 1985, Baltimore, Maryland, United States