Is coset enumeration the best way to get all the elements of a finitely presented group? if not what is the best algorithm to do this ? what difficulties could be caused by this process ( I mean storage difficulties ) ?
Personally, I have done many examples of finitely presented groups by TC algorithm. I like this method, however, sometimes it takes time, papers and its prime format. You might find some of them in my question, but there is another way which I am not familiar to it as I am with TC. It is called RSRP Reidemeister-Schreier Rewriting Process. Surely, for the proper explanation, we need a blackboard ;-) but what can I say that:
- This method is suggested for finding the presentation of a subgroup with preferably small index.
- It makes additional relations for the subgroup so it helps us to simplify the presentation more effective than TC.
- But it makes additional generators which sometimes they are not depend on our original generators and this is bad.
Anyway, in the cases we face to the group with heavily relations and maybe long, this method is suggested and I have seen that.