The diagonal inversion number of an integer partition. The dinv of a partition is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \in \{0,1\}$. See also exercise 3.19 of [2]. This statistic is equidistributed with the length of the partition, see [3].

The length of the partition.

The largest part of an integer 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.

The number of nestings of a perfect matching. This is the number of pairs of edges $((a,b), (c,d))$ such that $a\le c\le d\le b$. i.e., the edge $(c,d)$ is nested inside $(a,b)$.