Alexander Hulpke

This is not so much a problem with actions, but in creating the transversal (this is probably a bad example for the algorithm used there with little reduction to shorter...

@ThomasBreuer yes, though it should be noted that these performance problems are likely from the fact that the method used does not work well for this case (maximal subgroup of...

Currently GAP does not hash integers lists under permutation actions -- this is clearly an oversight. With this added, the `OrbitLength` example takes (M1 Pro processor) 17 seconds with no...

Are you sure it is an infinite loop? The commit just changes lookup, so my guess is that for so large exponents (2237) the new version of lookup used becomes...

Just to confirm that this is not a bug but slower performance on this example (because of the huge exponents). Part is that the older code was kernel while the...

The purpose of `FactorCosetAction` was to unify the case of transversal action and TC -- for fp groups transversal action is potentially quite slow. If you want transversal elements you...

> ``` > gap> Runtime(); # in milliseconds > 5360647 > ``` I have a change (in my work repository) that speeds this up by a factor of over 2...

With a further change it now takes (equivalent of) 30 seconds.

This is an infinite matrix group, so how would this be supposed to work? The only issue could be to have a nicer catch for this case, there are probably...

There are really two questions here: - Should the existing method be subject to extra conditions? (`IsFinite`, `CanEasilyTestMembership` would be potential candidates, even though the method is more general) -...