The 321-avoidance conjecture for products of ladder representations
Statement
Let be ladder representations, written as and , with and . For , let , let be its indicator representation, and let denote the corresponding Jacquet module. The multiplicity is one if and only if
and avoids the pattern.
This conjecture gives the proposed remaining rule for determining the irreducible factors of a product of two ladder representations. Multiplicity one is known for products of two ladder representations, and the permutation parameterization shows that all relevant candidates avoid ; the conjecture specifies exactly which candidates occur by combining pattern avoidance with the indicator multiplicity condition.
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.