If you're running out of memory with the representation you're using,
you can try IsomorphismPcGroup. Most algorithms tend to work faster
with that. Note that since your group has 2 prime divisors, it must be
solvable, hence it has a PC presentation. If you ever don't have a
solvable group, you can do SmallerDegreePermutationRepresentation.
Joe
Dan Lanke wrote:
Dear GAP Forum,
I have a permutation group (with two generators) of size 279936 = 2^7 * 3^7.
How do I go about trying to find its structure description?
Thanks,
Dan
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
