The first entry of the permutation.
This can be described as 1 plus the number of occurrences of the vincular pattern ([2,1], {(0,0),(0,1),(0,2)}), i.e., the first column is shaded, see [1].
This statistic is related to the number of deficiencies St000703The number of deficiencies of a permutation. as follows: consider the arc diagram of a permutation $\pi$ of $n$, together with its rotations, obtained by conjugating with the long cycle $(1,\dots,n)$. Drawing the labels $1$ to $n$ in this order on a circle, and the arcs $(i, \pi(i))$ as straight lines, the rotation of $\pi$ is obtained by replacing each number $i$ by $(i\bmod n) +1$. Then, $\pi(1)-1$ is the number of rotations of $\pi$ where the arc $(1, \pi(1))$ is a deficiency. In particular, if $O(\pi)$ is the orbit of rotations of $\pi$, then the number of deficiencies of $\pi$ equals
$$\frac{1}{|O(\pi)|}\sum_{\sigma\in O(\pi)} (\sigma(1)-1).$$

The inverse of a transformation of set partitions due to Yip.
Return the set partition of $\{1,...,n\}$ corresponding to the set of arcs, interpreted as a rook placement, applying Yip's bijection $\psi^{-1}$.

Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.

Sends a set partition to the associated standard tableau.
The $j$th column of the standard tableau associated to a set partition is the set of $j$th smallest elements of its blocks arranged in increassing order.