Sorting conjecture for stable symmetric-group representations
Sorting conjecture for stable symmetric-group representations
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.
Sources & referencesView supporting material
Primary source
Tao Gui, “Conjectures on the reduced Kronecker coefficients”, arXiv:2210.14668 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.