On Sun, 14 Dec 2008 at 05:09PM -0800, Mike Hansen wrote: > On Sun, Dec 14, 2008 at 4:04 PM, green351 <mmamashra...@gmail.com> wrote: > > This is my first time emailing with a question and my first time > > trying to use Sage (I'm a complete programming dunce). I'm trying to > > do the following: > > Given the tuple (p,q) in Z x Z and integer n I need to count the > > number of integer-tuple solutions to the following > > (p,q)=(a_1,b_1)+...+(a_n,b_n) subject to the following conditions > > - (a_i,b_i) \neq (a_j,b_j) for i, j different > > - a_i, b_i >= -1 > > - a_i+b_i > 0 > > What you're trying to count is the number of multiset partitions. I > haven't written any code to do this in Sage, but I've been meaning > too. So now is a good time to start :-)
If you want to play with Haskell, there's an article in the Monad Reader on multiset partitions: http://www.haskell.org/sitewiki/images/d/dd/TMR-Issue8.pdf Dan -- --- Dan Drake <dr...@kaist.edu> ----- KAIST Department of Mathematical Sciences ------- http://mathsci.kaist.ac.kr/~drake
signature.asc
Description: Digital signature
