A rewriting alternative to Reidemeister-Schreier

Authors:
Neil Ghani;Anne Heyworth
Affiliations:
Department of Mathematics and Computer Science, University of Leicester;Department of Mathematics and Computer Science, University of Leicester
Venue:
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Year:
2003

Citing 3
Cited 1

String-rewriting systems

String-rewriting systems
Term rewriting and all that

Term rewriting and all that
Word Processing in Groups

Word Processing in Groups

String rewriting for double coset systems

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

One problem in computational group theory is to find a presentation of the subgroup generated by a set of elements of a group. The Reidemeister-Schreier algorithm was developed in the 1930's and gives a solution based upon enumerative techniques. This however means the algorithm can only be applied to finite groups. This paper proposes a rewriting based alternative to the Reidemeister-Schreier algorithm which has the advantage of being applicable to infinite groups.