ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix D={d1<d2<⋯<dk}D=\{d_1<d_2<\cdots<d_k\} and suppose α,α↑∈Compn(D)\alpha,\alpha^{\uparrow}\in{\sf Comp}_n(D), where

α↑=(α1,…,αj−1,αj+1,αj+1,…,αn)\alpha^{\uparrow}=(\alpha_1,\ldots,\alpha_{j-1},\alpha_j+1,\alpha_{j+1},\ldots,\alpha_n)

for some jj such that αj+1≠αi\alpha_j+1\ne\alpha_i for every i≠ji\ne j. Say that a character is DD-multiplicity-free when its decomposition has no repeated multiplicities. The upward-closure conjecture. If κα\kappa_\alpha is not DD-multiplicity-free, then κα↑\kappa_{\alpha^{\uparrow}} is not DD-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.