Alexander Hulpke

I think the `PositionCanonical` magic is built in so deep and used in so many places that we need to keep it. The extra cost is nil if it defaults...

I agree that illegal actions are an recurring issue of "errors between keyboard and chair". There is already `TestIdentityAction` that is used to map one point under the identity and...

> > This should be integrated with the existing functiinality of `SufficientlySmallDegreeSimpleGroupOrder` (grp/simple.gi), which already provides much of this information up to order 2^55 > > Doesn't that function return...

There are lots of things that could work for all groups but at the moment are only implemented for particular representations. I think we are doing ourselves a disfavor by...

A main change seems a change from IsomorphismIrred to IsomorphismModules. What I want to make sure is that there will not be a chance of running in infinite recursion. I...

This got introduced after 4.B.1 and before 4.4. I have no recall of implementing/committing it, but would not be surprised if I actually did the commit in the past, possibly...

I think the issue is that the rank of G/G' is already 2, and thus 1 generator is infeasible. The routine should return a `fail` value.

> it returns fail. I guess, because the algorithm has to put a larger p-quotient underneath first? Indeed. The PQ takes the group of the prior layer and constructs it...

because as far I understand, the number of generators `n` is always chosen such that the resulting quotient has order `p^n` Yes.

> Okay, so I understood this part correctly. Indeed, I think it should be more lenient with the number of generators for the covering group. Are there any known bounds...