Sorting conjecture for stable symmetric-group representations
Statement
Let and be partitions. Rearrange all their parts in weakly decreasing order as
Define and . In , let denote the simple object indexed by , and order the Grothendieck ring coefficientwise.
Sorting conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.