Gordon Royle on Tue, 20 Jun 2006 02:34:36 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Partitions

Have you thought about using GAP?

GAP has a large range of built in combinatorial functions, and if your task is mainly combinatorial then maybe GAP is the right tool.

Personally I find that I use Pari for some tasks, GAP for others and Maple for still others because they have different strengths.



On 20/06/2006, at 6:23 AM, James McLaughlin wrote:

Just a suggestion for the next version of Pari/gp:

It would good to include a partition function that lets you pre-define
any set of integers S, and then, given any input integer n, will output a
list of partitions with parts from S.

Joerg Arndt has pointed out that he has such an algorithm in his online
book at http://www.jjj.de/fxt/#fxtbook , but it would good if someone
actually built it in to the next version of Pari/gp.

Thanks to Bill Allombert for pointing me towards a piece of code in the faqs that I was able to adapt for what I wanted, but it would be pleasant
to have an in-built function that does the same thing.

Jimmy Mc Laughlin.