The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. This is the multinomial of the multiplicities of the parts, see [1]. This is the same as $m_\lambda(x_1,\dotsc,x_k)$ evaluated at $x_1=\dotsb=x_k=1$, where $k$ is the number of parts of $\lambda$. An explicit formula is $\frac{k!}{m_1(\lambda)! m_2(\lambda)! \dotsb m_k(\lambda) !}$ where $m_i(\lambda)$ is the number of parts of $\lambda$ equal to $i$.

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 exponens consonantiae of a partition. This is the quotient of the least common multiple and the greatest common divior of the parts of the partiton. See [1, Caput sextum, §19-§22].

Difference between largest and smallest parts in a partition.

The radius of a connected graph. This is the minimum eccentricity of any vertex.

The diameter of a connected graph. This is the greatest distance between any pair of vertices.