On Sat, May 14, 2011 at 1:15 PM, Saptarshi Mandal <sapta.iit...@gmail.com> wrote: > I have fleshed out the structure of a permutation. It inherits from > the Basic class and will attempt to be completely symbolic a bit later > (this part is easy). > The algorithms to generate various permutations itself is in > iterables. I have planned similarly for partitions. A partition itself > will be a multiset and will contain > partitions as elements. The multiset can be filled up using any one of > the partition generating algorithms I have committed in my iterables > branch. > Again various operations can be defined on these structures. > > Comments and feedback will be appreciated!
Please post a link to your code. Ondrej -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
