Weight-preserving bijection between queue inversion and HHL statistics

Let λ\lambda be a partition and nn a positive integer, and let Tab(λ,n)\operatorname{Tab}(\lambda,n) denote the set of tableaux of shape λ\lambda with entries bounded by nn. For fillings σ\sigma and τ\tau, write στ\sigma\sim\tau when they are row-equivalent, meaning that each corresponding pair of rows contains the same entries with the same multiplicities. Let maj\operatorname{maj}, inv\operatorname{inv}, and quinv\operatorname{quinv} denote the major index, HHL inversion, and queue inversion statistics.

Bijection conjecture. Given λ\lambda and nn, there exists a bijection

δ:Tab(λ,n)Tab(λ,n)\delta:\operatorname{Tab}(\lambda,n)\longrightarrow\operatorname{Tab}(\lambda,n)

such that, for every σ\sigma, δ(σ)σ\delta(\sigma)\sim\sigma, maj(δ(σ))=maj(σ)\operatorname{maj}(\delta(\sigma))=\operatorname{maj}(\sigma), and

inv(δ(σ))=quinv(σ).\operatorname{inv}(\delta(\sigma))=\operatorname{quinv}(\sigma).

Such a bijection would be sufficient to prove the tableau formula for the modified Macdonald polynomial from the HHL formula, because it would preserve row content and major index while exchanging queue inversion and HHL inversion weights. The supplied text gives no evidence that this conjecture has been resolved.

Sources & referencesView supporting material

Primary source

Arvind Ayyer, Olya Mandelshtam and James B. Martin, “Modified Macdonald polynomials and the multispecies zero range process: I”, arXiv:2011.06117 (2021).

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.