On a conjecture concerning shuffle-compatible permutation statistics (Q2153397)

Summary: The notion of shuffle-compatible permutation statistics was implicit in Stanley's work on P-partitions and was first explicitly studied by \textit{I. M. Gessel} and \textit{Y. Zhuang} [Adv. Math. 332, 85--141 (2018; Zbl 1388.05008)]. The aim of this paper is to prove that the triple (udr, pk, des) is shuffle-compatible as conjectured by Gessel and Zhuang [loc. cit.], where (udr) denotes the number of up-down runs, (pk) denotes the peak number, and (des) denotes the descent number. This is accomplished by establishing an (udr, pk, des)-preserving bijection in the spirit of \textit{D. Baker-Jarvis} and \textit{B. E. Sagan}'s bijective proofs of the shuffle compatibility property of permutation statistics [Adv. Appl. Math. 113, Article ID 101973, 29 p. (2020; Zbl 1440.05003)].