RandomPartition[n] constructs a random partition of integer n.
RandomRGF[n] returns a random restricted growth function (RGF) defined on the first n natural numbers. RandomRGF[n, k] returns a random RGF defined on the first n natural ...
RandomSetPartition[set] returns a random set partition of set. RandomSetPartition[n] returns a random set partition of the first n natural numbers.
RandomTableau[p] constructs a random Young tableau of shape p.
RankRGF
(Combinatorica Package Symbol) RankRGF[f] returns the rank of a restricted growth function (RGF) f in the lexicographic order of all RGFs.
RankSetPartition[sp, s] ranks sp in the list of all set partitions of set s. RankSetPartition[sp] ranks sp in the list of all set partitions of the set of elements that ...
RGFQ
(Combinatorica Package Symbol) RGFQ[l] yields True if l is a restricted growth function. It yields False otherwise.
RGFs
(Combinatorica Package Symbol) RGFs[n] lists all restricted growth functions on the first n natural numbers in lexicographic order.
RGFToSetPartition[rgf, set] converts the restricted growth function rgf into the corresponding set partition of set.
SetPartitionQ[sp, s] determines if sp is a set partition of set s. SetPartitionQ[sp] tests if sp is a set of disjoint sets.