Sends a Dyck path to a 321-avoiding permutation.
This bijection defined in [3, pp. 60] and in [2, Section 3.1].
It is shown in [1] that it sends the number of centered tunnels to the number of fixed points, the number of right tunnels to the number of exceedences, and the semilength plus the height of the middle point to 2 times the length of the longest increasing subsequence.

Return the reversal of the permutation obtained by inverting the corresponding Laguerre heap.
This map is the composite of Mp00241invert Laguerre heap and Mp00064reverse.
Conjecturally, it is also the rowmotion on the weak order:
Any semidistributive lattice $L$ has a canonical labeling of the edges of its Hasse diagram by its join irreducible elements (see [1] and [2]). Rowmotion on this lattice is the bijection which takes an element $x \in L$ with a given set of down-labels to the unique element $y \in L$ which has that set as its up-labels (see [2] and [3]). For example, if the lattice is the distributive lattice $J(P)$ of order ideals of a finite poset $P$, then this reduces to ordinary rowmotion on the order ideals of $P$.
The weak order (a.k.a. permutohedral order) on the permutations in $S_n$ is a semidistributive lattice. In this way, we obtain an action of rowmotion on the set of permutations in $S_n$.
Note that the dynamics of weak order rowmotion is poorly understood. A collection of nontrivial homomesies is described in Corollary 6.14 of [4].

Sents a permutation to its complement.
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(i)$