Ok I see. Thanks for the clarification Mike and Simon. I'll try to
look at what Dan posted.
On a slightly tangential but related point: How can one solve
equations involving tuples in coordinate-wise arithmetic. For example
my intuition is to write something like
a,b = var('a b')
A=tuple([a,b])
solve([A[i]==[2,2] for i in [0,1]], a,b)
to solve the equations (a,b)=(2,2) but it doesn't seem to work (gives
me an error message).
-sonny
On Dec 15, 12:08 pm, "Mike Hansen" <mhan...@gmail.com> wrote:
> 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
-~----------~----~----~----~------~----~------~--~---
