Alexander Hulpke

As far as `ClosueSubgroupNC` is concerned (I have no opinion on `ClosureSubgroup`): I see assertions not as the tool to catch erroneous user input, but as a tool to find...

I think the expectations for working with finitely presented groups really are too high, and I am doubtful that it is worth (at least my) time to try to conceive...

> Oh wait is the method you're referring to, this: > > ``` > InstallMethod( Enumerator,"fp gp.", true,[IsSubgroupFpGroup and IsFinite],0, > G->RightTransversal(G,TrivialSubgroup(G))); Yes, that is the method. IIRC, it is...

> Wouldn't one possible solution be to just store the coset table produced > (in the `Size` method for finitely presented groups) in the group, and then use this in...

Was already fixed in branch hulpke/work, now put into PR.

I am still puzzled why people want to calculate element lists of fp groups, rather than go to a permutation representation. Certainly this peripheral use should not direct how we...

@ThomasBreuer My concern is that there migth be some calculation that assumes the right transversal in a cyclic group by the trivial subgroup being not a list, but a fancy...

I'll leave the \= business aside as I'm not sure what would prevent implementing a \= method for such objects. (Or do I misunderstand and you actually act on equivalence...

@ThomasBreuer Yes, if the objects have basically no relevant properties, it is probably easier to write the orbit algorithm in Julia (with teh appropriate equality test) than to hope that...

When converting to a permutation representation this works for me in the development version. It is likely not not work in 4.12, in part because it relies on pretabulated data....