Total ordering on subgroups and cosets

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Total ordering on subgroups and cosets

Full text

Pdf (200 KB)

Source

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

Philadelphia, PA, USA

Pages: 156 - 160

Year of Publication: 2003

ISBN:1-58113-641-2

Authors

Alexander Hulpke	Colorado State University, Fort Collins, CO
Steve Linton	University of St Andrews, St Andrews, Fife KY16 9SS, U.K.

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 25, Citation Count: 1

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

ABSTRACT

We show how to compute efficiently a lexicographic ordering for subgroups and cosets of permutation groups and, more generally, of finite groups with a faithful permutation representation.

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	The GAP Group, http://www.gap-system.org. GAP -- Groups, Algorithms, and Programming, Version 4.3, 2002.
	2	D. F. Holt. The calculation of the Schur multiplier of a permutation group. In M. D. Atkinson, editor, Computational Group theory, pages 307--319. Academic press, 1984.
	3	A. Hulpke. Constructing transitive permutation groups. submitted, http://www.math.colostate.edu/ hulpke/paper/transgp.html.
	4	E. M. Luks. Permutation groups and polynomial-time computation. In L. Finkelstein and W. M. Kantor, editors, Groups and Computation, volume 11 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 139--175, Providence, RI, 1993. Amer. Math. Soc.
	5	Á. Seress. Permutation Group Algorithms. Cambridge University Press, 2003.
	6	C. C. Sims. Determining the conjugacy classes of a permutation group. In G. Birkhoff and M. H. Jr., editors, Computers in Algebra and Number theory, pages 191--195, Providence, RI, 1971. Amer. Math. Soc.