ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 0n2n0^n2^n denote the corresponding tensor product module, let Soc⁡i\operatorname{Soc}_i denote its ii-th socle layer, and let s2(r)s_2(r) be the sum of the binary digits of rr. The socle structure conjecture for 0n2n0^n2^n. The module 0n2n0^n2^n is socle-multiplicity free, and

Soc⁡i(0n2n)={[0,2]s2(i−1),i≤2n,{0},otherwise.\operatorname{Soc}_i(0^n2^n)= \begin{cases} [0,2]^{s_2(i-1)},& i\leq 2^n,\\ \{0\},&\text{otherwise.} \end{cases}

The displayed strong-module graphs for small nn motivate this exact binary-digit pattern; no general proof is supplied.

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.