The absolute length of a permutation.
The absolute length of a permutation $\sigma$ of length $n$ is the shortest $k$ such that $\sigma = t_1 \dots t_k$ for transpositions $t_i$. Also, this is equal to $n$ minus the number of cycles of $\sigma$.

Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..

Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.

The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.