Shuffle-compatibility of the up-down run and peak statistics

Let a permutation statistic assign an invariant to each permutation, and call it shuffle-compatible if, for any two disjoint permutations, the multiset of its values on their shuffles depends only on the two input statistics. Let udr\operatorname{udr} denote the up-down run statistic, pk\operatorname{pk} the peak statistic, and des\operatorname{des} the descent statistic. The up-down run–peak shuffle-compatibility conjecture. The tuples

(udr,pk)(\operatorname{udr},\operatorname{pk})

and

(udr,pk,des)(\operatorname{udr},\operatorname{pk},\operatorname{des})

are shuffle-compatible. This is one of the paper's empirically supported conjectures about joint permutation statistics; its resolution is not given in the source.

Sources & referencesView supporting material

Primary source

Ira M. Gessel and Yan Zhuang, “Shuffle-compatible permutation statistics”, arXiv:1706.00750 (2018).

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.