Sorting Permutations with Fixed Pinnacle Set

We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi \in S_n$, a {\em pinnacle} of $\pi$ is an element ${\pi }_i$ ($i\neq 1,n$)suchthat$\pi_{i-1}<\pi_i>\pi_{i+1}$\mathrm{.}Thequestionis:given$\pi,\pi’\in S_n$withthesamepinnacleset$S$, is there a sequence of operations that transforms $\pi$ into ${\pi }^{\mathrm{\prime }}$ such that all the intermediate permutations have pinnacle set $S$? We introduce {\em balanced reversals}, defined as reversals that do not modify the pinnacle set of the permutation to which they are applied. Then we show that $\pi$ may be sorted by balanced reversals (i.e. transformed into a standard permutation ${\text{Id}}_S$), implying that $\pi$ may be transformed into ${\pi }^{\mathrm{\prime }}$ using at most $4n-2\min \{p,3\}$ balanced reversals, where $p=\mathrm{\mid }S\mathrm{\mid }\ge 1$. In case $p=0$, at most $2n-1$ balanced reversals are needed.