Hi, For fixed positive integers k and N, I'd like to compute the list of partitions
N = n_1 + n_2 + ... + n_k such that n_1 < n_2 < ... < n_k. What's the best (i.e. fastest) way to achieve this? -- Best, Alex -- Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne http://aghitza.org -- 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.
