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.

Sends a permutation to its Robinson-Schensted recording tableau.
The Robinson-Schensted corrspondence is a bijection between permutations of length $n$ and pairs of standard Young tableaux of the same shape and of size $n$, see [1]. These two tableaux are the insertion tableau and the recording tableau.
This map sends a permutation to its corresponding recording tableau.

The bounce path determined by an integer composition.

Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].