If that you want are the cosets you can get them simply using cosets = Set([Set([h*g for h in H]) for g in G])
or if you want to get a representative of each coset you can then use reps = [x[0] for x in cosets] this should work even if H is not normal, the only issue being that the set of cosets is not a group. Not sure if it will help with your problem, though. Cheers J. On Jul 31, 5:27 pm, Robert Schwarz <[email protected]> wrote: > Yes, the cosets are, what I really want (although generators would be > very nice, too, if they exist, e.g. if the quotient is normal). > > The application was the following: Suppose you have a linear equation > with multi-indexed variables, like x_1,2 + x_2,3 + x_3,1 == 0, which > also holds for all permutations of {1, 2, 3}, and I want to enumerate > all possible equations, but without duplicates. I hoped it was possible > to first compute the permutations under whose operation the exact same > equation result, then take the subgroup H generated by those and use > representants from the cosets of S_n/H to get all unique equations. > Looks like it's not that simple, since H doesn't even have to be normal, > in general. > > Thanks a lot , though. > > -- > Robert Schwarz <[email protected]> > > Get my public key athttp://rschwarz.net/key.asc --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
