Multipartition sorting conjecture for stable symmetric-group representations

About 4 years old · traced to

Let λ(1),…,λ(n)\lambda^{(1)},\ldots,\lambda^{(n)} be partitions, and let λ=⋃iλ(i)\lambda=\bigcup_i\lambda^{(i)} be obtained by rearranging all parts in weakly decreasing order. For a partition λ\lambda, define

λ[i,n]=(λi,λi+n,λi+2n,…).\lambda^{[i,n]}=(\lambda_i,\lambda_{i+n},\lambda_{i+2n},\ldots).

Let Vρ[∞]V_{\rho[\infty]} be the simple object of Rep⁡(S∞)\operatorname{Rep}(S_{\infty}) indexed by ρ\rho, with the coefficientwise Grothendieck-ring order.

Multipartition sorting conjecture.

⨂i=1nVλ[i,n][∞]≥⨂i=1nVλ(i)[∞].\bigotimes_{i=1}^nV_{\lambda^{[i,n]}[\infty]} \geq \bigotimes_{i=1}^nV_{\lambda^{(i)}[\infty]}.

This extends the two-part sorting inequality and a special case of a conjecture of Lascoux, Leclerc, and Thibon. The paper presents it as a consequence one might obtain by repeatedly applying the preceding conjecture; the general statement remains open.

References

Primary source

Tao Gui, “Conjectures on the reduced Kronecker coefficients”, arXiv:2210.14668 (2026).

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.