LongestIncreasingSubsequence[p] finds the longest increasing scattered subsequence of permutation p.
NextComposition[l] constructs the integer composition that follows l in a canonical order.
NextTableau[t] gives the tableau of shape t, following t in lexicographic order.
NumberOfCompositions[n, k] counts the number of distinct compositions of integer n into k parts.
PermutationToTableaux[p] returns the tableaux pair that can be constructed from p using the Robinson\[Dash]Schensted\[Dash]Knuth correspondence.
RandomComposition[n, k] constructs a random composition of integer n into k parts.
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 ...
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.
RGFQ
(Combinatorica Package Symbol) RGFQ[l] yields True if l is a restricted growth function. It yields False otherwise.