← All problems

The compositional shuffle conjecture

9 years old · traced to

Let X={x1,x2,…}X=\{x_1,x_2,\ldots\} be an infinite set of variables, and write xw=xw1⋯xwnx_w=x_{w_1}\cdots x_{w_n}. Let α=(α1,…,αk)\alpha=(\alpha_1,\ldots,\alpha_k) be a composition of nn. For a Dyck path π\pi of semilength nn, let touch⁡(π)=α\operatorname{touch}(\pi)=\alpha mean that the successive gaps between its contacts with the main diagonal have lengths α1,…,αk\alpha_1,\ldots,\alpha_k. Let WPπ\mathcal{WP}_\pi be the associated word parking functions, and let area⁡(π)\operatorname{area}(\pi) and dinv⁡(π,w)\operatorname{dinv}(\pi,w) be their statistics. The operator CαC_\alpha is the compositional creation operator, and Cα(1)C_\alpha(1) denotes its value at 11.

The compositional shuffle conjecture. For any composition α\alpha,

(−1)n∇Cα(1)=∑touch⁡(π)=αtarea⁡(π)∑w∈WPπqdinv⁡(π,w)xw.(-1)^n\nabla C_\alpha(1)=\sum_{\operatorname{touch}(\pi)=\alpha}t^{\operatorname{area}(\pi)}\sum_{w\in\mathcal{WP}_\pi}q^{\operatorname{dinv}(\pi,w)}x_w.

This refines the original shuffle conjecture by partitioning the Dyck-path sum according to the touch composition.

References

Status

  • Solved: Erik Carlsson and Anton Mellit. A proof of the shuffle conjecture (Journal of the American Mathematical Society, 2018) https://arxiv.org/abs/1508.06239

Source: James Haglund and Guoce Xin, “Lecture notes on the Carlsson-Mellit proof of the shuffle conjecture”, arXiv:1705.11064 (2017).

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.