Alexander Hulpke

Polynomials know about the Characteristics, not about a coefficient ring that is strictly smaller than its quotient field. That is, they behave in your example as if you had defined...

Before making a major investment in special "nice monomorphism" methods, it mighty be worth thinking how much we want to leverage composition tree (the recog package) and rather implement methods...

No opposition to do both, but the nice monomorphism model looks as if it will stumble soon again on another command after having gotten it over one hurdle.

> We can do more: > * My interpretation of the function `SubgroupsOrbitsAndNormalizers` is that its approach is cheaper than `IsConjugate` Yes and no. The method for `LowIndexSubgroups` is a...

> Pinging [@hulpke](https://github.com/hulpke) who Did you miss: "wrote the most elegant code" :-) I have a fix. A selection of normal subgroup representatives is too limited.

> [@hulpke](https://github.com/hulpke) I have applied your fix to my installation. While the number of perfect subgroups is now correct, the subgroups themselves aren't: > > ``` > List(ConjugacyClassesPerfectSubgroups(G),Size); > [...

I really liked the concept of Name spaces, in particular in starting with the translation of Magma Code. It allows for packages to use their own, descriptive, names, even if...

(This is already in 4.dev about a factor 4 faster, because of some improvements to the heuristics.) The problem is basically: Double cosets A\G/B are computed along a chain of...

Indeed these tricks to find subgroups (and more) are all employed. The issue in the example is not that GAP does not find the (one intermediate) subgroup but that it...

> [@hulpke](https://github.com/hulpke) I do not understand what the current situation is. > > Is there already experimental code that is significantly faster than the current one? (I wrote that for...