> More precisely, before processing, I make the list of subgroups up to
> conjugation. Then I want to be able to sort the vectors depending on
> the conjugacy class of the stabilizer (I do not care about the class
> of the group).
There probably a lot of different strategy, I don't know the canoni
>> 1) iteration of couples "(vector, stabilizer of the vector)"
>
> It depend on what kind of information you want in `stabilizer of the
> vector`. If you want it to be a sage or gap permutation group, it can be
> very very painful (especially for speed...). The orbit is `very easy` to
> get, for
Le dimanche 10 avril 2011 à 10:36 +, Vincent Delecroix a écrit :
> Hello Nicolas (the little),
Hello,
> 1) iteration of couples "(vector, stabilizer of the vector)"
It depend on what kind of information you want in `stabilizer of the
vector`. If you want it to be a sage or gap permutation
Hello Nicolas (the little),
I'm widely interested in your class for exhaustive generation of
vectors modulo permgroup ! Thank you for this nice patch.
My need are a bit more general:
1) iteration of couples "(vector, stabilizer of the vector)"
2) iteration through vectors such that the stabi
