Computing with matrix groups using permutation representations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing with matrix groups using permutation representations

Full text

Pdf (652 KB)

Source

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

Montreal, Quebec, Canada

Pages: 259 - 264

Year of Publication: 1995

ISBN:0-89791-699-9

Authors

Gene Cooperman	College of Computer Science, Northeastern University, Boston, MA
Larry Finkelstein	College of Computer Science, Northeastern University, Boston, MA
Michael Tselman	College of Computer Science, Northeastern University, Boston, MA

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): 2, Downloads (12 Months): 10, 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/220346.220379 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	L. Babai and R. Beals, "Las Vegas Algorithms for Matrix Groups", Proc. 24th IEEE FOCS (1993), pp. 427- 436.
	2	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]
	3	R. Beals, "Computing blocks of imprimitivity for smallbase groups in nearly linear time," DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, 1993, pp. 17-26, L. Finkelstein and W.M. Kantor (eds.), AMS, Providence, RI. 11, 1993, pp. 17-26, L. Finkelstein and W.M. Kantor (eds.), AMS, Providence, RI.
	4	G. Butler, "The Schreier Algorithm for Matrix Groups", SYMSAC '76 (Proc. 1976 ACM Syrup.on Symbolic and Algebraic Computation. Yorktown Heights, 1976) R.D. Jenks (ed.). ACM. New York. pp 167-170.
	5	Gene Cooperman , Larry Finkelstein , Bryant York , Michael Tselman, Constructing permutation representations for large matrix groups, Proceedings of the international symposium on Symbolic and algebraic computation, p.134-138, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190384]
	6	G. Cooperman, L. Finkelstein, M. Tselman and B. York, "Constructing Permutation Representations for Matrix Groups", preprint.
	7	D. F. Hol~ and S. Rees "Testing modules for irreducibility", manuscript.
	8	B. Huppert, "Endliche Gruppen I", Springer Verlag, New York, 1967.
	9	J. Leon, "On an Algorithm for Finding a Base and Strong Generating Set for a Group Given by a Set of Generating Permutations", Math. Comp. 35 (1980), pp. 941-974.
	10	R. Lyons, "Evidence for a New Finite Simple Group", Journal of Algebra, 20 (1972), 540-569.
	11	R. Parker, 'The computer calculation of modular chaxacters. (The Meat-Axe)', in M. Atkinson (ed.), Computational Group Theory, Academic Press, London, 267- 74, 1984.
	12	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]
	13	C.C. Sims, "The Existence and Uniqueness of Lyons Group", Proceeding of the Gainseville Conference, (1972), pp 138-141.