Abstract
Many important problems in computational group theory were solved using a finite presentation of a group by generators and relations. In particular, studying the structure of groups and subgroups or solving the word problem for finite groups requires the knowledge of a presentation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Butler. Fundamental Algorithms for Permutation Groups, volume 559 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
J. J. Cannon. Construction of defining relators for finite groups. Discrete Mathematics, 5:105–129, 1973.
D. B. A. Epstein, D. F. Holt, and S. Rees. The use of Knuth-Bendix methods to solve the word problem in automatic groups. Journal of Symbolic Computation, 12:397–414, 1991.
Donald E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford, 1970.
D. Kapur and H. Zhang. RRL: A rewrite rule laboratory. In Proceedings 9th International Conference on Automated Deduction, Argonne (III., USA), volume 310 of Lecture Notes in Computer Science, pages 768-769. Springer-Verlag, 1988.
Ph. Le Chenadec. Canonical Forms in Finitely Presented Algebras. John Wiley & Sons, 1986.
J.S. Leon. On an algorithm of finding a base and strong generating set for a group given by a set of generating permutations. Mathematics of Computation, 35:941–974, 1980.
C.L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, Inc., New York, 1968.
Christopher Lynch and Polina Strogova. Patch graphs: an efficient data structure for completion of finitely presented groups. Technical Report 96-R-026, CRIN, 1996.
W. W. McCune. Otter 3.0: Reference manual and guide. Technical Report 6, Argonne National Laboratory, 1994.
M. H. A. Newman. On theories with a combinatorial definition of equivalence. In Annals of Math, volume 43, pages 223–243, 1942.
C.C. Sims. Computation with permutation groups. In S.R. Petrick, editor, Proceedings of the Second Symposium on Symbolic and Algebraic Manipulation, Los Angeles, 1971.
C. C. Sims. Computation with finitely presented groups. In Encyclopedia of Math. and Its Applications, volume 48. Cambridge Univ. Pr., 1994.
H. Zhang. Herky: High-performance rewriting techniques in RRL. In D. Kapur, editor, Proceedings of 1992 International Conference of Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 696-700. Springer-Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Basel AG
About this paper
Cite this paper
Strogova, P. (1998). Finding a Finite Group Presentation Using Rewriting. In: Bronstein, M., Weispfenning, V., Grabmeier, J. (eds) Symbolic Rewriting Techniques. Progress in Computer Science and Applied Logic, vol 15. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8800-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8800-4_13
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9779-2
Online ISBN: 978-3-0348-8800-4
eBook Packages: Springer Book Archive