RandomSetPartition[set] returns a random set partition of set. RandomSetPartition[n] returns a random set partition of the first n natural numbers.

RandomSubset[l] creates a random subset of set l.

RankBinarySubset[l, s] gives the rank of subset s of set l in the ordering of subsets of l, obtained by interpreting these subsets as binary string representations of ...

RankGrayCodeSubset[l, s] gives the rank of subset s of set l in the Gray code ordering of the subsets of l.

RankKSetPartition[sp, s] ranks sp in the list of all k-block set partitions of s. RankSetPartition[sp] ranks sp in the list of all k-block set partitions of the set of ...

RankKSubset[s, l] gives the rank of k-subset s of set l in the lexicographic ordering of the k-subsets of l.

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 ...

RootedEmbedding[g, v] constructs a rooted embedding of graph g with vertex v as the root. RootedEmbedding[g] constructs a rooted embedding with a center of g as the root.

RotateVertices[v, \[Theta]] rotates each vertex position in list v by \[Theta] radians about the origin (0, 0). RotateVertices[g, \[Theta]] rotates the embedding of the graph ...

SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.