The conjectural height-three induction rule
The conjectural height-three induction rule
From papers
Let be a completely splittable partition of height with . Let denote its regularized partition, and let and be the specified nodes. Let denote the corresponding partition operation.
Height-three induction conjecture.
This is a special branching formula for completely splittable partitions of height three. The source gives no proof or resolution status.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Vladimir Shchigolev, “On extensions and branching rules for modules close to completely splittable”, arXiv:math/0408164 (2004).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.