The number of connected components of a skew partition.

Sends a Dyck path $D$ of length $2n$ to its bounce path.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.

The parallelogram polyomino corresponding to a Dyck path, interpreted as a skew partition.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
This map returns the skew partition definded by the diagram of $\gamma(D)$.

Return a Dyck path with number of returns and length of the last descent interchanged.
This is the specialisation of the map $\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.