Hello, On Mon, Dec 15, 2008 at 11:48 AM, Simon King <k...@mathematik.uni-jena.de> wrote: > I guess Sonny refers to the original post, where the following > conditions are stated: >> - (a_i,b_i) \neq (a_j,b_j) for i, j different >> - a_i, b_i >= -1 >> - a_i+b_i > 0 > > Are they implicit in your code? I don't see it, I'm afraid...
Oh, I had originally read (a_i, b_i >= -1) as (a_i, b_i > -1) which would then make it just counting multiset partitions. If it is really the former case, then I don't know any efficient ways to count them other than just generating all the solutions which I'm pretty sure can be done using a modification of the algorithm that Dan posted. --Mike --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
