ConstructTableau[p] performs the bumping algorithm repeatedly on each element of permutation p, resulting in a distinct Young tableau.

DeleteFromTableau[t, r] deletes the last element of row r from Young tableau t.

FerrersDiagram[p] draws a Ferrers diagram of integer partition p.

LongestIncreasingSubsequence[p] finds the longest increasing scattered subsequence of permutation p.

NextPartition[p] gives the integer partition following p in reverse lexicographic order.

NextTableau[t] gives the tableau of shape t, following t in lexicographic order.

NumberOfTableaux[p] uses the hook length formula to count the number of Young tableaux with shape defined by partition p.

PartitionQ[p] yields True if p is an integer partition. PartitionQ[n, p] yields True if p is a partition of n.

PermutationToTableaux[p] returns the tableaux pair that can be constructed from p using the Robinson\[Dash]Schensted\[Dash]Knuth correspondence.

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