By the way, no idea about where I should write that in Sage ? :-/ Nathann
On 14 September 2014 13:19, Nathann Cohen <[email protected]> wrote: > Yo ! > >> this is only one of the current trends - other ones argue that algorithms >> should be accompanied by implementations, and then there is a lot of things >> done >> on polynomial-time algorithms. > > Well, it should at the very least be implemented (with commented code) > indeed. It would also be cool if people cared about the actual > comutation times: using bitsets does not change anything > asymptotically but it does make a difference in the running times. > >> Anyhow, one speedup can come from your function being invariant under some >> permutations of variables; perhaps you can check this quickly. > > Does not apply to my case but there is a great thing about that in > Sage if it interests you: With just one line you can enumerate, from a > group acting G on a set of points, a representative of each orbit of > the action of G on the groups of size k. > > Example: > > sage: > IntegerVectorsModPermutationGroup(groups.permutation.Cyclic(5),sum=3,max_part=1) > Vectors of length 5 and of sum 3 whose entries is in {0, ..., 1} > enumerated up to the action of Cyclic group of order 5 as a > permutation group > > Nathann -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
