The upward-closure conjecture for non-multiplicity-free characters
Statement
Fix and suppose , where
for some such that for every . Say that a character is -multiplicity-free when its decomposition has no repeated multiplicities. The upward-closure conjecture. If is not -multiplicity-free, then is not -multiplicity-free. This local monotonicity statement is intended to support the reduction from infinitely many weight checks to a single check; the source gives no proof or 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.