It seems that some way to uniquely index each partition is needed.
For permutations, we can use factoradic numbers to index everything N! permutations. Given a factoradic nubmer, we can directly generate the corresponding permutation; and vice versa.
Is there any similar indexing scheme available for partitions?
