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 major index of a set partition. The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1\dots w_n\}$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$. The major index of $w$ is the sum of the positions $i$ such that $w_i > w_{i+1}$.

The comajor index of a permutation. This is, $\operatorname{comaj}(\pi) = \sum_{i \in \operatorname{Des}(\pi)} (n-i)$ for a permutation $\pi$ of length $n$.

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.

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.