RandomPartition[n] constructs a random partition of integer n.
PartitionMap[f, list, n] applies f to list after partitioning into nonoverlapping sublists of length n. PartitionMap[f, list, n, d] applies f to sublists obtained by ...
CoarserSetPartitionQ[a, b] yields True if set partition b is coarser than set partition a; that is, every block in a is contained in some block in b.
DominatingIntegerPartitionQ[a, b] yields True if integer partition a dominates integer partition b, that is, the sum of a size-t prefix of a is no smaller than the sum of a ...
RandomKSetPartition[set, k] returns a random set partition of set with k blocks. RandomKSetPartition[n, k] returns a random set partition of the first n natural numbers into ...
RandomSetPartition[set] returns a random set partition of set. RandomSetPartition[n] returns a random set partition of the first n natural numbers.
RGFToSetPartition[rgf, set] converts the restricted growth function rgf into the corresponding set partition of set.
SetPartitionToRGF[sp, set] converts the set partition sp of set into the corresponding restricted growth function.
TransposePartition[p] reflects a partition p of k parts along the main diagonal, creating a partition with maximum part k.
UnrankSetPartition[r, s, k] finds a k-block set partition of s with rank r. UnrankSetPartition[r, n, k] finds a k-block set partition of {1, 2, ..., n} with rank r.