The ordinary-partition containment conjecture

Less than 1 year old · traced to

Let P\mathcal{P} be the set of partitions, let P2reg\mathcal{P}_{\mathrm{2reg}} be the set of 2-regular partitions, and let ORD⁡:P→P2reg\operatorname{ORD}:\mathcal{P}\rightarrow\mathcal{P}_{\mathrm{2reg}} be the function defined from the first column of the spar tableau. If λ,ν∈P\lambda,\nu\in\mathcal{P} and ν\nu is obtained by deleting the last row of λ\lambda, then ordinary-partition containment conjecture.

ORD⁡(ν)⊆ORD⁡(λ).\operatorname{ORD}(\nu)\subseteq\operatorname{ORD}(\lambda).

This conjecture concerns the behavior of the ordinary-partition function under deletion of a row and is used to support corresponding containment statements for the associated crystal combinatorics.

References

Primary source

Samantha Allen, Jack Isaac, Corinne Moscariello, Robert Muth, Bella Deborah Uwase and Lucas Walton, “Kleshchev multipartitions, affine Mirković-Vilonen polytopes, and representations of KLR algebras in type A^(1)_1”, arXiv:2606.00421 (2026).

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.