Hello, Early in the SoC process there was an interest in keeping the combinatorics module as symbolic and SymPy-like as possible. After discussing this with the Saptarshi for a while, I thought it best to start the discussion here.
The general idea is to have the combinatoric objects inherit from the most natural SymPy objects possible (Expr if a number is expected in the end, etc). For Permutations, that is Basic. I've advised Saptarshi to have Permutation accept any iterable that contains Expr objects. Specific algorithms that operate on permutations will be implemented to work with arbitrary Expr objects as best possible. Any feedback / thoughts on this approach? Cheers, Christian -- 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.
