> no, no, that's not what you want to do, certainly. A much more efficient > way > is to compute a strong generating set w.r.t. a "canonical" minimal base. > data into a canonical form of a permutation group.
There is no "canonical" minimal base, unless one specifies the group action to such an extent that most permutation group representations are excluded. Seriously, if you need some sort of canonical form for permutation groups, you must restrict to primitive actions. In the real world, this just isn't a sensible approach. Each abstract group has infinitely many permutation group representations. ONLY the primitive representations are currently classified in any detail below a given degree, and as such those are the only canonical representations that would even be available. Jaosn -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
