The number of pairwise different full-rank reflection subgroups of the associated Weyl group. Let $\mathcal{R} \subseteq W$ be the set of reflections in the Weyl group $W$. A (possibly empty) subset $X \subseteq \mathcal{R}$ generates a subgroup of $W$ that is again a reflection group. This is the number of all pairwise different full-rank subgroups of $W$ obtained this way. If $\Phi^+$ is an associated set of positive roots, then this also is the number of subsets $Y \subseteq \Phi^+$ such that $Y$ is a simple system of some type and $|Y| = n$, where $n$ is the rank of $W$. For example the group of type $B_2$ has two different subgroups of type $A_1 \times A_1$ and itself as full-rank reflection subgroups.

The largest nonnegative integer which is not a part and is smaller than the largest part of the partition.

The size of the orbit of an integer partition in Bulgarian solitaire. Bulgarian solitaire is the dynamical system where a move consists of removing the first column of the Ferrers diagram and inserting it as a row. This statistic returns the number of partitions that can be obtained from the given partition.

The area of a Dyck path. This is the number of complete squares in the integer lattice which are below the path and above the x-axis. The 'half-squares' directly above the axis do not contribute to this statistic. 1. Dyck paths are bijection with '''area sequences''' $(a_1,\ldots,a_n)$ such that $a_1 = 0, a_{k+1} \leq a_k + 1$. 2. The generating function $\mathbf{D}_n(q) = \sum_{D \in \mathfrak{D}_n} q^{\operatorname{area}(D)}$ satisfy the recurrence $$\mathbf{D}_{n+1}(q) = \sum q^k \mathbf{D}_k(q) \mathbf{D}_{n-k}(q).$$ 3. The area is equidistributed with [[St000005]] and [[St000006]]. Pairs of these statistics play an important role in the theory of $q,t$-Catalan numbers.

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 number of evenly positioned ascents of the Dyck path, with the initial position equal to 1.

The number of non-final maximal constant sub-paths of length greater than one. This is the total number of occurrences of the patterns $110$ and $001$.

The dinv defect of an integer partition. This is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \not\in \{0,1\}$.

The sum of the heights of the peaks of a Dyck path minus the number of peaks.

The number of invariant subsets of size 2 when acting with a permutation of given cycle type.