ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ\lambda and μ\mu be partitions. Rearrange all their parts in weakly decreasing order as

λ∪μ=(ν1,ν2,ν3,…).\lambda\cup\mu=(\nu_1,\nu_2,\nu_3,\ldots).

Define sort⁡1(λ,μ)=(ν1,ν3,ν5,…)\operatorname{sort}_1(\lambda,\mu)=(\nu_1,\nu_3,\nu_5,\ldots) and sort⁡2(λ,μ)=(ν2,ν4,ν6,…)\operatorname{sort}_2(\lambda,\mu)=(\nu_2,\nu_4,\nu_6,\ldots). In Rep⁡(S∞)\operatorname{Rep}(S_{\infty}), let Vλ[∞]V_{\lambda[\infty]} denote the simple object indexed by λ\lambda, and order the Grothendieck ring coefficientwise.

Sorting conjecture.

Vsort⁡1(λ,μ)[∞]⊗Vsort⁡2(λ,μ)[∞]≥Vλ[∞]⊗Vμ[∞].V_{\operatorname{sort}_1(\lambda,\mu)[\infty]}\otimes V_{\operatorname{sort}_2(\lambda,\mu)[\infty]} \geq V_{\lambda[\infty]}\otimes V_{\mu[\infty]}.

This generalizes the cited sorting conjecture for tensor-product multiplicities. Its validity would give a broad family of coefficientwise inequalities in the stable representation category; the paper does not establish it in general.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.