Dear Forum, I have a question about computational group theory:
Is there an algorithm to compute all the subgroups of a permutation group ? I know there is an algorithm for solvable groups. However I am looking for an algorithm that would work for small permutation groups (say degree <=100, order <=1000) preferably without having precomputed tables for all perfect groups. Thanks, Bill _______________________________________________ Forum mailing list Forum@gap-system.org https://mail.gap-system.org/mailman/listinfo/forum
