The staircase-weight multiplicity-free converse conjecture
Statement
Suppose and . Let , and let . Write for the relevant character and say that it is -multiplicity-free when its decomposition has no repeated multiplicities. The staircase-weight multiplicity-free converse conjecture. If is -spherical, then is -multiplicity-free. The preceding corollary proves the contrapositive implication; the conjecture would make that criterion an equivalence and reduce an infinite family of checks to one staircase weight. The source does not state a resolution.
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.