The distinct-weight multiplicity obstruction 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 distinct-weight multiplicity obstruction conjecture. If is not -spherical, then there exists a strictly decreasing weight such that is not -multiplicity-free. This is presented as a weaker assertion that would still yield a finite-check algorithmic obstruction to sphericality; its status is not resolved in the supplied text.
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.