The number of maximal chains in a poset.

The width of the poset. This is the size of the poset's longest antichain, also called Dilworth number.

The length of the longest staircase fitting into an integer composition. For a given composition $c_1,\dots,c_n$, this is the maximal number $\ell$ such that there are indices $i_1 < \dots < i_\ell$ with $c_{i_k} \geq k$, see [def.3.1, 1]

The number of maximal chains of maximal size in a poset.

Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. Given a partition $\lambda$ with $r$ parts, the number of semi-standard Young-tableaux of shape $k\lambda$ and boxes with values in $[r]$ grows as a polynomial in $k$. This follows by setting $q=1$ in (7.105) on page 375 of [1], which yields the polynomial $$p(k) = \prod_{i < j}\frac{k(\lambda_j-\lambda_i)+j-i}{j-i}.$$ The statistic of the degree of this polynomial. For example, the partition $(3, 2, 1, 1, 1)$ gives $$p(k) = \frac{-1}{36} (k - 3) (2k - 3) (k - 2)^2 (k - 1)^3$$ which has degree 7 in $k$. Thus, $[3, 2, 1, 1, 1] \mapsto 7$. This is the same as the number of unordered pairs of different parts, which follows from: $$\deg p(k)=\sum_{i < j}\begin{cases}1& \lambda_j \neq \lambda_i\\0&\lambda_i=\lambda_j\end{cases}=\sum_{\stackrel{i < j}{\lambda_j \neq \lambda_i}} 1$$

The weighted size of a partition. Let $\lambda = (\lambda_0\geq\lambda_1 \geq \dots\geq\lambda_m)$ be an integer partition. Then the weighted size of $\lambda$ is $$\sum_{i=0}^m i \cdot \lambda_i.$$ This is also the sum of the leg lengths of the cells in $\lambda$, or $$ \sum_i \binom{\lambda^{\prime}_i}{2} $$ where $\lambda^{\prime}$ is the conjugate partition of $\lambda$. This is the minimal number of inversions a permutation with the given shape can have, see [1, cor.2.2]. This is also the smallest possible sum of the entries of a semistandard tableau (allowing 0 as a part) of shape $\lambda=(\lambda_0,\lambda_1,\ldots,\lambda_m)$, obtained uniquely by placing $i-1$ in all the cells of the $i$th row of $\lambda$, see [2, eq.7.103].

The number of parts equal to 1 in a partition.

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

The number of standard desarrangement tableaux of shape equal to the given partition. A '''standard desarrangement tableau''' is a standard tableau whose first ascent is even. Here, an ascent of a standard tableau is an entry $i$ such that $i+1$ appears to the right or above $i$ in the tableau (with respect to English tableau notation). This is also the nullity of the random-to-random operator (and the random-to-top) operator acting on the simple module of the symmetric group indexed by the given partition. See also: * [[St000046]]: The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition * [[St000500]]: Eigenvalues of the random-to-random operator acting on the regular representation.