Gessel's equidistribution conjecture for permutations with disjoint cycle types
Let and be integer partitions with no common part. Let and be permutations of cycle types and , respectively, with disjoint supports. Let be the subset of the conjugacy class of cycle type consisting of the permutations for which the relative order of the letters in the union of all cycles of is as in , and the relative order of the letters in the union of all cycles of is as in . Gessel's conjecture. Then
This equidistribution identity connects descent enumerators on a constrained conjugacy class with those on shuffles of the two permutations.
References
Status
- Solved: Ron M. Adin, Sergi Elizalde, Ira M. Gessel, and Yuval Roichman. Shuffles of permutations in cycle form (arXiv, 2026) https://arxiv.org/html/2611.15723
Source: Ron M. Adin and Yuval Roichman, “Cyclic descents, matchings and Schur-positivity”, arXiv:2210.14839 (2023).
Progress summary
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.