A set of of n elements can be partitioned in non empty subsets.
This package provide function to list all possible partitions. The number of partition is Bell's number.
The number of subsets that composed the partitions can be optionally specified. The number of partition is Stirling's number of the second kind.
Thank you a lot! I needed these functions in my Optimization project
Excellent codes, really fast!!
Is there an easy way to generate the partitions incrementally? I mean I'd like to use it for big N so it would be great if there was a way to generate a different partition a time, because of space limits.
Very nice: smartly coded, fast, well implemented.
Darren, thank you for the suggestion. I'll add an example of usage. Functions with more efficient engine will be soon upgraded.
At last someone has implemented this functionality. Excellent!
I would only suggest that an example of usage and output could be helpful in the SetPartition file and that the first few lines of Bell and Stirling2nd could be rearranged to give meaningful H1 lines.
Partitions display function
Possibility to partition generic set elements (following Matt Fig's idea). New function to replace elements of a standard set partitioning list
Correct a BUG for N=0. Minor speed improvement.
Improve engine and example usage in the help as suggested Darren Rowland