The conjectural height-three induction rule

About 22 years old · traced to

Let λ\lambda be a completely splittable partition of height 33 with h1,1(λ)=2p−1h_{1,1}(\lambda)=2p-1. Let λ~\tilde\lambda denote its regularized partition, and let A=(3,λ~3+1)A=(3,\tilde\lambda_3+1) and B=(4,1)B=(4,1) be the specified nodes. Let H(0,1,−1)\mathcal H_{(0,1,-1)} denote the corresponding partition operation.

Height-three induction conjecture.

[Ind⁡−3ˉDλ~]=2[Dλ~A]+[Dλ~B]+[DH(0,1,−1)(λ~A)].[\operatorname{Ind}^{-\bar 3}D^{\tilde\lambda}]=2[D^{\tilde\lambda^A}]+[D^{\tilde\lambda^B}]+[D^{\mathcal H_{(0,1,-1)}(\tilde\lambda^A)}].

This is a special branching formula for completely splittable partitions of height three. The source gives no proof or resolution status.

References

Primary source

Vladimir Shchigolev, “On extensions and branching rules for modules close to completely splittable”, arXiv:math/0408164 (2004).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.