The permutation formulation of the rational Shuffle Conjecture

At least 10 years old · documented by

Let S~nm\widetilde{S}_n^m be the set of affine permutations used in the rational parking-function model, let area⁡(ω)\operatorname{area}(\omega) and dinv⁡(ω)\operatorname{dinv}(\omega) be their associated statistics, and let Qdes⁡(ω−1)(z)Q_{\operatorname{des}(\omega^{-1})}(z) be the Gessel fundamental quasisymmetric function indexed by the descent set of ω−1\omega^{-1}.

Permutation formulation of the rational Shuffle Conjecture. The following equation holds:

Pm,n⋅1=∑ω∈S~nmqarea⁡(ω)tdinv⁡(ω)⋅Qdes⁡(ω−1)(z).P_{m,n}\cdot 1=\sum_{\omega\in \widetilde{S}_n^m}q^{\operatorname{area}(\omega)}t^{\operatorname{dinv}(\omega)}\cdot Q_{\operatorname{des}(\omega^{-1})}(z).

This reformulates the rational Shuffle Conjecture in terms of affine permutations rather than rational parking functions, using the correspondence between rational parking functions and the relevant affine-permutation data. Its resolution status is not specified in the supplied material.

References

Primary source

Eugene Gorsky and Mikhail Mazin, “Rational Parking Functions and LLT Polynomials”, arXiv:1503.04181 (2015).

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.