The number of distinct parts of the integer partition. This statistic is also the number of removeable cells of the partition, and the number of valleys of the Dyck path tracing the shape of the partition.

The number of ordinal summands of a poset. The ordinal sum of two posets $P$ and $Q$ is the poset having elements $(p,0)$ and $(q,1)$ for $p\in P$ and $q\in Q$, and relations $(a,0) < (b,0)$ if $a < b$ in $P$, $(a,1) < (b,1)$ if $a < b$ in $Q$, and $(a,0) < (b,1)$. This statistic is the length of the longest ordinal decomposition of a poset.

The side length of the largest staircase partition fitting into a partition. For an integer partition $(\lambda_1\geq \lambda_2\geq\dots)$ this is the largest integer $k$ such that $\lambda_i > k-i$ for $i\in\{1,\dots,k\}$. In other words, this is the length of a longest (strict) north-east chain of cells in the Ferrers diagram of the partition, using the English convention. Equivalently, this is the maximal number of non-attacking rooks that can be placed on the Ferrers diagram. This is also the maximal number of occurrences of a colour in a proper colouring of a Ferrers diagram. A colouring of a Ferrers diagram is proper if no two cells in a row or in a column have the same colour. The minimal number of colours needed is the maximum of the length and the first part of the partition, because we can restrict a latin square to the shape. We can associate to each colouring the integer partition recording how often each colour is used, see [1]. This statistic records the largest part occurring in any of these partitions.

The order dimension of the partition. Given a partition $\lambda$, let $I(\lambda)$ be the principal order ideal in the Young lattice generated by $\lambda$. The order dimension of a partition is defined as the order dimension of the poset $I(\lambda)$.

The number of addable cells of the Ferrers diagram of an integer partition.

The number of upper covers of a partition in dominance order.

The multiplicity of the standard representation in the Kronecker square corresponding to a partition. The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$: $$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$ This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{(n-1)1}$, for $\lambda\vdash n > 1$. For $n\leq1$ the statistic is undefined. It follows from [3, Prop.4.1] (or, slightly easier from [3, Thm.4.2]) that this is one less than [[St000159]], the number of distinct parts of the partition.