Gessel and Zhuang's shuffle-compatibility conjecture for (udr,pk,des)(\mathrm{udr},\mathrm{pk},\mathrm{des})

For a permutation τ\tau, let udr\rm udr, pk\rm pk, and des\rm des denote the permutation statistics of the length of the longest up-down run, the number of peaks, and the number of descents, respectively. A statistic is shuffle-compatible if, for any two permutations with disjoint ground sets, the multiset of its values over their shuffles depends only on the statistic values of the two permutations. Gessel and Zhuang's conjecture. The triple (udr,pk,des)(\rm udr,\rm pk,\rm des) is shuffle-compatible. This conjecture concerns whether the joint distribution of these three permutation statistics is preserved under shuffling in the required sense. The paper states that it proves this conjecture, so the conjecture is resolved.

Sources & referencesView supporting material

Primary source

Lihong Yang and Sherry H. F. Yan, “On a conjecture concerning the shuffle-compatible permutation statistics”, arXiv:2201.06784 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.