HideCycles[c] canonically encodes the cycle structure c into a unique permutation.
InsertIntoTableau[e, t] inserts integer e into Young tableau t using the bumping algorithm. InsertIntoTableau[e, t, All] inserts e into Young tableau t and returns the new ...
KSubsetGroupIndex[g, s, x] returns the cycle index of the k-subset group on s expressed as a polynomial in x[1], x[2], .... This function also takes the optional argument ...
NumberOfPermutationsByInversions[n, k] gives the number of permutations of length n with exactly k inversions. NumberOfPermutationsByInversions[n] gives a table of the number ...
PartitionQ[p] yields True if p is an integer partition. PartitionQ[n, p] yields True if p is a partition of n.
RandomSubset[l] creates a random subset of set l.
RGFToSetPartition[rgf, set] converts the restricted growth function rgf into the corresponding set partition of set.
SetPartitions[set] returns the list of set partitions of set. SetPartitions[n] returns the list of set partitions of {1, 2, ..., n}.
SetPartitionToRGF[sp, set] converts the set partition sp of set into the corresponding restricted growth function.
Strings
(Combinatorica Package Symbol) Strings[l, n] constructs all possible combinatorial strings of length n from the elements of list l.