The number of big descents of a permutation. For a permutation $\pi$, this is the number of indices $i$ such that $\pi(i)-\pi(i+1) > 1$. The generating functions of big descents is equal to the generating function of (normal) descents after sending a permutation from cycle to one-line notation [[Mp00090]], see [Theorem 2.5, 1]. For the number of small descents, see [[St000214]].

The number of big deficiencies of a permutation. A big deficiency of a permutation $\pi$ is an index $i$ such that $i - \pi(i) > 1$. This statistic is equidistributed with any of the numbers of big exceedences, big descents and big ascents.

The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation.

The number of valleys of a Dyck path not on the x-axis. That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.

The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation.

The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation.

The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. Let $\nu$ be a (partial) permutation of $[k]$ with $m$ letters together with dashes between some of its letters. An occurrence of $\nu$ in a permutation $\tau$ is a subsequence $\tau_{a_1},\dots,\tau_{a_m}$ such that $a_i + 1 = a_{i+1}$ whenever there is a dash between the $i$-th and the $(i+1)$-st letter of $\nu$, which is order isomorphic to $\nu$. Thus, $\nu$ is a vincular pattern, except that it is not required to be a permutation. An arrow pattern of size $k$ consists of such a generalized vincular pattern $\nu$ and arrows $b_1\to c_1, b_2\to c_2,\dots$, such that precisely the numbers $1,\dots,k$ appear in the vincular pattern and the arrows. Let $\Phi$ be the map [[Mp00087]]. Let $\tau$ be a permutation and $\sigma = \Phi(\tau)$. Then a subsequence $w = (x_{a_1},\dots,x_{a_m})$ of $\tau$ is an occurrence of the arrow pattern if $w$ is an occurrence of $\nu$, for each arrow $b\to c$ we have $\sigma(x_b) = x_c$ and $x_1 < x_2 < \dots < x_k$.

The number of big exceedences of a permutation. A big exceedence of a permutation $\pi$ is an index $i$ such that $\pi(i) - i > 1$. This statistic is equidistributed with either of the numbers of big descents, big ascents, and big deficiencies.

The number of big ascents of a permutation. For a permutation $\pi$, this is the number of indices $i$ such that $\pi(i+1)−\pi(i) > 1$. For the number of small ascents, see [[St000441]].

Eigenvalues of the top-to-random operator acting on a simple module. These eigenvalues are given in [1] and [3]. The simple module of the symmetric group indexed by a partition $\lambda$ has dimension equal to the number of standard tableaux of shape $\lambda$. Hence, the eigenvalues of any linear operator defined on this module can be indexed by standard tableaux of shape $\lambda$; this statistic gives all the eigenvalues of the operator acting on the module. This statistic bears different names, such as the type in [2] or eig in [3]. Similarly, the eigenvalues of the random-to-random operator acting on a simple module is [[St000508]].