Hello all, I am currently working on a small engine to enumerate integer lists modulo the action of a permutation group. Here is the ticket on the trac : http://sagetrac.org/sage_trac/ticket/6812.
The important class is the Parent of Category InfiniteEnumeratedSets. This set is the set of all cosets (classes d'équivalence in french) of integer vectors modulo the action of a fixed permutation group. Elements of this Parent are just list of integer but all list are canonical in the sens that they are maximum in their orbit under the action of the permutation group (maximum according the lex order.) ------------------------------------------------------------------------ sage: I = IntegerVectorsUptoPermGroup(PermutationGroup([[(1,2,3)],[(2,3,4)]])) sage: [5,2,0,0] in I True sage: [5,0,2,0] in I False sage: [2,2,0,1] in I False sage: [3,2,0,1] in I True sage: p = [0,0,0,0] sage: for i in range(20): ....: print p ....: p = I.next(p) ....: [0, 0, 0, 0] [1, 0, 0, 0] [2, 0, 0, 0] [1, 1, 0, 0] [3, 0, 0, 0] [2, 1, 0, 0] [1, 1, 1, 0] [4, 0, 0, 0] [3, 1, 0, 0] [2, 2, 0, 0] [2, 1, 1, 0] [1, 1, 1, 1] [5, 0, 0, 0] [4, 1, 0, 0] [3, 2, 0, 0] [3, 1, 1, 0] [2, 2, 1, 0] [2, 1, 1, 1] [6, 0, 0, 0] [5, 1, 0, 0] ------------------------------------------------------------------------ This set contains thus canonical representatives of cosets... Does anyone have suggestion for a good name for this parent ? Does anyone would like to review that after... Currently : IntegerVectorsUptoPermGroup MuPAD : IntegerVectorsModPermutationGroup Other proposition : ??? Cheers, Nicolas the little. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en -~----------~----~----~----~------~----~------~--~---
