ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥6n\geq 6. For a partition λ\lambda and a prime pp, write SFpλS_{\mathbb F_p}^{\lambda} for the corresponding Specht module and DFpμD_{\mathbb F_p}^{\mu} for the simple module indexed by the pp-regular partition μ\mu; [SFpλ:DFpμ][S_{\mathbb F_p}^{\lambda}:D_{\mathbb F_p}^{\mu}] denotes its composition multiplicity. For a congruence condition, {n\conpr}\{n\con_p r\} is 11 when n≡r(modp)n\equiv r\pmod p and 00 otherwise.

Multiplicity formula. The seven asserted formulas in the source hold: for n≥9n\geq9, [SF2(n−4,2,12):DF2(n−4,4)]=1[S_{\mathbb F_2}^{(n-4,2,1^2)}:D_{\mathbb F_2}^{(n-4,4)}]=1; for n≥7n\geq7, [SF2(n−4,2,12):DF2(n−3,3)]={n\con20}[S_{\mathbb F_2}^{(n-4,2,1^2)}:D_{\mathbb F_2}^{(n-3,3)}]=\{n\con_2 0\}; and the remaining five formulas are exactly those displayed in the source statement.

These are explicit decomposition-number assertions for symmetric-group Specht modules. The supplied text gives no resolution status or discussion establishing them, so their conjectural status requires verification.

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.