The inversion number of a standard tableau as defined by Haglund and Stevens. Their inversion number is the total number of inversion pairs for the tableau. An inversion pair is defined as a pair of cells (a,b), (x,y) such that the content of (x,y) is greater than the content of (a,b) and (x,y) is north of the inversion path of (a,b), where the inversion path is defined in detail in [1].

The Gini index of an integer partition. As discussed in [1], this statistic is equal to [[St000567]] applied to the conjugate partition.

The charge of a standard tableau.

The sum of the products of all pairs of parts. This is the evaluation of the second elementary symmetric polynomial which is equal to $$e_2(\lambda) = \binom{n+1}{2} - \sum_{i=1}^\ell\binom{\lambda_i+1}{2}$$ for a partition $\lambda = (\lambda_1,\dots,\lambda_\ell) \vdash n$, see [1]. This is the maximal number of inversions a permutation with the given shape can have, see [2, cor.2.4].

The cocharge of a standard tableau. The '''cocharge''' of a standard tableau $T$, denoted $\mathrm{cc}(T)$, is defined to be the cocharge of the reading word of the tableau. The cocharge of a permutation $w_1 w_2\cdots w_n$ can be computed by the following algorithm: 1) Starting from $w_n$, scan the entries right-to-left until finding the entry $1$ with a superscript $0$. 2) Continue scanning until the $2$ is found, and label this with a superscript $1$. Then scan until the $3$ is found, labeling with a $2$, and so on, incrementing the label each time, until the beginning of the word is reached. Then go back to the end and scan again from right to left, and *do not* increment the superscript label for the first number found in the next scan. Then continue scanning and labeling, each time incrementing the superscript only if we have not cycled around the word since the last labeling. 3) The cocharge is defined as the sum of the superscript labels on the letters.

The (standard) major index of a standard tableau. A descent of a standard tableau $T$ is an index $i$ such that $i+1$ appears in a row strictly below the row of $i$. The (standard) major index is the the sum of the descents.

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$.