> In Maple help
>
> maplehelp(combstruct[specification])
>
> I can find
>
> (labeled)
> F=Set(Set(Z,card>=1)) set partitions
>
> (unlabeled)
> A=Set(Sequence(Z,card>=1)) integer partition
If you want to highlight the species correspondence, you could also
reuse the same grammar:
A=Set(Set(Z,card>=1))
In the unlabeled case, this is equivalent!
Here is what we get in MuPAD-Combinat:
>> Grammar := [Partition = Set(Set(Z, MinLength=1))]:
>> IntPart := combinat::decomposableObjects(Grammar):
>> SetPart := combinat::decomposableObjects(Grammar, Labelled):
>> IntPart::count(n) $ n=0..10
1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42
>> combinat::partitions::count(n) $ n=0..10
1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42
>> SetPart::count(n) $ n=0..10
1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975
>> combinat::setPartitions::count(n) $ n=0..10
1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975
I guess the use of Sequence above may make the algorithms a little bit
faster as you give a hint to the program that the internal Set is
trivial w.r.t. unlabeled objects.
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <[EMAIL PROTECTED]>
http://Nicolas.Thiery.name/
-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Aldor-combinat-devel mailing list
Aldor-combinat-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/aldor-combinat-devel
