The size of a partition.
This statistic is the constant statistic of the level sets.

The dominating partition in the Schur expansion.
Consider the expansion of the skew Schur function $s_{\lambda/\mu}=\sum_\nu c^\lambda_{\mu, \nu} s_\nu$ as a linear combination of straight Schur functions.
It is shown in [1] that the partitions $\nu$ with $c^\lambda_{\mu, \nu} > 0$ form a sublattice of the dominance order and that its top element is the conjugate of the partition formed by sorting the column lengths of $\lambda / \mu$ into decreasing order.
This map returns the largest partition $\nu$ in dominance order for which $c^\lambda_{\mu, \nu}$ is positive.
For example,
$$ s_{331/2} = s_{311} + s_{32}, $$
and the partition $32$ dominates $311$.

The parallelogram polyomino corresponding to a Dyck path, interpreted as a skew partition.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
This map returns the skew partition definded by the diagram of $\gamma(D)$.