Pattern-avoiding permutation conjecture for multiplicities of maximal weights
Statement
Let be the integrable highest weight -module. For the maximal dominant weights , write for their multiplicity. A permutation of is -avoiding when it has no decreasing subsequence of length .
Pattern-avoidance conjecture. The multiplicities satisfy
This conjecture proposes a permutation-theoretic interpretation of the multiplicities, extending the lattice-path formulas developed in the paper. The source gives the lattice-path case, but does not state a general resolution of this permutation conjecture.
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.