Yes. I'm turning things like Add(a,b,c,d,e) into things like Add(a, Add(b, c, d), e). Either both Adds are commutative (using sets) or neither are.
On Fri, Nov 2, 2012 at 4:20 PM, Chris Smith <[email protected]> wrote: > On Wed, Oct 31, 2012 at 2:27 AM, Matthew Rocklin <[email protected]> > wrote: > > Awesome. Following the "if you give a bear a cookie he'll ask for a > glass of > > milk principle" can we use these algorithms to efficiently only produce > > unique sets in the commutative case? > > > > Do you only need the two types of partitions: lists of lists and sets > of sets as you said at > > http://stackoverflow.com/questions/13131491/partition-n-items-into-k-bins-in-python-lazily/13184004#13184004 > ? > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > 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/sympy?hl=en. > > -- You received this message because you are subscribed to the Google Groups "sympy" group. 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/sympy?hl=en.
