ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix d∈Z≥0d\in\mathbb{Z}_{\geq 0}. Let Bd\mathcal{B}_d be the nontrivial block in Rep⁡‾(Sd;F)\underline{\operatorname{Rep}}(S_d;F) containing L(∅)L(\varnothing), and let

Res⁡‾SdSd+1:Rep⁡‾(Sd+1;F)→Rep⁡‾(Sd;F)\underline{\operatorname{Res}}_{S_d}^{S_{d+1}}:\underline{\operatorname{Rep}}(S_{d+1};F)\to\underline{\operatorname{Rep}}(S_d;F)

be the restriction functor. Write Inc⁡Bd+1\operatorname{Inc}_{\mathcal{B}_{d+1}} for inclusion into Rep⁡‾(Sd+1;F)\underline{\operatorname{Rep}}(S_{d+1};F) and Proj⁡Bd\operatorname{Proj}_{\mathcal{B}_d} for projection onto Bd\mathcal{B}_d. Restriction equivalence conjecture. The functor

Proj⁡Bd∘Res⁡‾SdSd+1∘Inc⁡Bd+1:Bd+1⟶Bd\operatorname{Proj}_{\mathcal{B}_d}\circ\underline{\operatorname{Res}}_{S_d}^{S_{d+1}}\circ\operatorname{Inc}_{\mathcal{B}_{d+1}}: \mathcal{B}_{d+1}\longrightarrow\mathcal{B}_d

induces an equivalence of additive categories Bd+1≅Bd\mathcal{B}_{d+1}\cong\mathcal{B}_d. This predicts that the non-semisimple blocks are stable, up to the indicated restriction and projection, as the parameter changes from d+1d+1 to dd; the source provides no resolution status for the conjecture.

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.