The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition.

The number of join irreducibles minus the rank of a lattice. A lattice is join-extremal, if this statistic is $0$.

The monochromatic index of a connected graph. This is the maximal number of colours such that there is a colouring of the edges where any two vertices can be joined by a monochromatic path. For example, a circle graph other than the triangle can be coloured with at most two colours: one edge blue, all the others red.

The Plancherel distribution on integer partitions. This is defined as the distribution induced by the RSK shape of the uniform distribution on permutations. In other words, this is the size of the preimage of the map 'Robinson-Schensted tableau shape' from permutations to integer partitions. Equivalently, this is given by the square of the number of standard Young tableaux of the given shape.

The number of semistandard tableaux on a given integer partition with minimal maximal entry. This is, for an integer partition $\lambda = (\lambda_1 > \cdots > \lambda_k > 0)$, the number of [[SemistandardTableaux|semistandard tableaux]] of shape $\lambda$ with maximal entry $k$. Equivalently, this is the evaluation $s_\lambda(1,\ldots,1)$ of the Schur function $s_\lambda$ in $k$ variables, or, explicitly, $$ \prod_{(i,j) \in L} \frac{k + j - i}{ \operatorname{hook}(i,j) }$$ where the product is over all cells $(i,j) \in L$ and $\operatorname{hook}(i,j)$ is the hook length of a cell. See [Theorem 6.3, 1] for details.