Dear GAP people, I was wondering what would happen if one calls the
AbelianInvariantsNormalClosureFpGroup(G,H); in case when the normal closure of subgroup H in G is actually infinitely generated? Will it keep requesting more and more memory without producing the final answer? I am running an example where I suspect that the normal closure of H is a perfect group. But it may as well be infinitely generated. Is there a chance that the algorithm will detect that it is perfect if I feed enough memory to it? Thank you! Ignat Soroko https://www.math.lsu.edu/~ignatsoroko/ _______________________________________________ Forum mailing list Forum@gap-system.org https://mail.gap-system.org/mailman/listinfo/forum
