ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F\mathbb{F} be a field of characteristic p>0p>0, let Hn=HF,−1(Sn)\mathcal{H}_n=\mathcal{H}_{\mathbb{F},-1}(\mathfrak{S}_n), and let λ\lambda be a doubly-singular partition of nn. A partition is doubly-singular when both it and its conjugate λ′\lambda' are 22-singular. For such a partition, define integers aa, bb, and cc by

a=max⁡{i:λi−λi+1⩾2},b=max⁡{i:λi=λi+1⩾1},c=max⁡{j:λa+j>0}.a=\max\{i:\lambda_i-\lambda_{i+1}\geqslant 2\},\qquad b=\max\{i:\lambda_i=\lambda_{i+1}\geqslant 1\},\qquad c=\max\{j:\lambda_{a+j}>0\}.

The partition λ\lambda is an FM-partition if all of the following hold: λi−λi+1⩽1\lambda_i-\lambda_{i+1}\leqslant 1 for i≠ai\ne a; λb⩾a−1⩾b\lambda_b\geqslant a-1\geqslant b; λ1>⋯>λc\lambda_1>\cdots>\lambda_c; if c=0c=0, all addable nodes except possibly those in the first row and first column have the same residue; and if c>0c>0, all addable nodes have the same residue. A partition is a 2p2p-core if none of its hook lengths is divisible by 2p2p.

Fayers–Mathas conjecture. The Hn\mathcal{H}_n-module SλS^\lambda is irreducible if and only if λ\lambda is a 2p2p-core and λ\lambda or λ′\lambda' is an FM-partition.

This conjecture proposes the classification of irreducible Specht modules labelled by doubly-singular partitions in positive characteristic. The source explains that non-2p2p-cores give reducible modules and that only finitely many FM-partitions remain to be checked for each prime pp; the proposed complete classification is based on computer calculations.

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.