The number of inversions of a permutation. This equals the minimal number of simple transpositions $(i,i+1)$ needed to write $\pi$. Thus, it is also the Coxeter length of $\pi$.

The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. For a permutation $\sigma = p \tau_{1} \tau_{2} \cdots \tau_{k}$ in its hook factorization, [1] defines $$\textrm{lec} \, \sigma = \sum_{1 \leq i \leq k} \textrm{inv} \, \tau_{i} \, ,$$ where $\textrm{inv} \, \tau_{i}$ is the number of inversions of $\tau_{i}$.

The number of exclusive right-to-left minima of a permutation. This is the number of right-to-left minima that are not left-to-right maxima. This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3. Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$. See also [[St000213]] and [[St000119]].

The number of deficiencies of a permutation. This is defined as $$\operatorname{dec}(\sigma)=\#\{i:\sigma(i) < i\}.$$ The number of exceedances is [[St000155]].

The cardinality of the support of a permutation. A permutation $\sigma$ may be written as a product $\sigma = s_{i_1}\dots s_{i_k}$ with $k$ minimal, where $s_i = (i,i+1)$ denotes the simple transposition swapping the entries in positions $i$ and $i+1$. The set of indices $\{i_1,\dots,i_k\}$ is the '''support''' of $\sigma$ and independent of the chosen way to write $\sigma$ as such a product. See [2], Definition 1 and Proposition 10. The '''connectivity set''' of $\sigma$ of length $n$ is the set of indices $1 \leq i < n$ such that $\sigma(k) < i$ for all $k < i$. Thus, the connectivity set is the complement of the support.

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 transpositions that are smaller or equal to a permutation in Bruhat order. A statistic is known to be '''smooth''' if and only if this number coincides with the number of inversions. This is also equivalent for a permutation to avoid the two pattern $4231$ and $3412$.