The number of exceedances (also excedences) of a permutation.
This is defined as $exc(\sigma) = \#\{ i : \sigma(i) > i \}$.
It is known that the number of exceedances is equidistributed with the number of descents, and that the bistatistic $(exc,den)$ is Euler-Mahonian. Here, $den$ is the Denert index of a permutation, see St000156The Denert index of a permutation..

Return a permutation whose multiset of invisible inversion bottoms is the multiset of descent views of the given permutation.
This map is similar to Mp00235descent views to invisible inversion bottoms, but different beginning with permutations of six elements.
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that

• the multiset of descent views in $\pi$ is the multiset of invisible inversion bottoms in $\chi(\pi)$,
• the set of left-to-right maximima of $\pi$ is the set of maximal elements in the cycles of $\chi(\pi)$,
• the set of global ascent of $\pi$ is the set of global ascent of $\chi(\pi)$,
• the set of maximal elements in the decreasing runs of $\pi$ is the set of deficiency positions of $\chi(\pi)$, and
• the set of minimal elements in the decreasing runs of $\pi$ is the set of deficiency values of $\chi(\pi)$.