The major index of a permutation. This is the sum of the positions of its descents, $$\operatorname{maj}(\sigma) = \sum_{\sigma(i) > \sigma(i+1)} i.$$ Its generating function is $[n]_q! = [1]_q \cdot [2]_q \dots [n]_q$ for $[k]_q = 1 + q + q^2 + \dots q^{k-1}$. A statistic equidistributed with the major index is called '''Mahonian statistic'''.

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 Denert index of a permutation. It is defined as $$ \begin{align*} den(\sigma) &= \#\{ 1\leq l < k \leq n : \sigma(k) < \sigma(l) \leq k \} \\ &+ \#\{ 1\leq l < k \leq n : \sigma(l) \leq k < \sigma(k) \} \\ &+ \#\{ 1\leq l < k \leq n : k < \sigma(k) < \sigma(l) \} \end{align*} $$ where $n$ is the size of $\sigma$. It was studied by Denert in [1], and it was shown by Foata and Zeilberger in [2] that the bistatistic $(exc,den)$ is [[Permutations/Descents-Major#Euler-Mahonian_statistics|Euler-Mahonian]]. Here, $exc$ is the number of weak exceedences, see [[St000155]].

The sorting index of a permutation. The sorting index counts the total distance that symbols move during a selection sort of a permutation. This sorting algorithm swaps symbol n into index n and then recursively sorts the first n-1 symbols. Compare this to [[St000018]], the number of inversions of a permutation, which is also the total distance that elements move during a bubble sort.

The number of non-inversions of a permutation. For a permutation of $\{1,\ldots,n\}$, this is given by $\operatorname{noninv}(\pi) = \binom{n}{2}-\operatorname{inv}(\pi)$.

The load of a permutation. The definition of the load of a finite word in a totally ordered alphabet can be found in [1], for permutations, it is given by the major index [[St000004]] of the reverse [[Mp00064]] of the inverse [[Mp00066]] permutation.

The inverse major index of a permutation. This is the major index [[St000004]] of the inverse permutation [[Mp00066]].

The maz index, the major index of a permutation after replacing fixed points by zeros. The descent set is denoted by $\operatorname{ZDer}(\sigma)$ in [1].

The maf index of a permutation. Let $\sigma$ be a permutation with fixed point set $\operatorname{FIX}(\sigma)$, and let $\operatorname{Der}(\sigma)$ be the derangement obtained from $\sigma$ by removing the fixed points. Then $$\operatorname{maf}(\sigma) = \sum_{i \in \operatorname{FIX}(\sigma)} i - \binom{|\operatorname{FIX}(\sigma)|+1}{2} + \operatorname{maj}(\operatorname{Der}(\sigma)),$$ where $\operatorname{maj}(\operatorname{Der}(\sigma))$ is the major index of the derangement of $\sigma$.

The disorder of a permutation. Consider a permutation $\pi = [\pi_1,\ldots,\pi_n]$ and cyclically scanning $\pi$ from left to right and remove the elements $1$ through $n$ on this order one after the other. The '''disorder''' of $\pi$ is defined to be the number of times a position was not removed in this process. For example, the disorder of $[3,5,2,1,4]$ is $8$ since on the first scan, 3,5,2 and 4 are not removed, on the second, 3,5 and 4, and on the third and last scan, 5 is once again not removed.