Interval conjecture for (n2,2)(n-2,2) in the immersion poset

From papers

For a partition μ\mu of nn, let

Aμ={λ(1n)IλIμ}A_\mu=\{\lambda\mid(1^n)\leqslant_I\lambda\leqslant_I\mu\}

be its lower interval in the immersion poset, and let I\lessdot_I denote a cover relation. The (n2,2)(n-2,2) interval conjecture states that, for n=5n=5 or n9n\geqslant9,

A(n2,2)={(1n),(2,1n2),(2,2,1n4),(n2,2)},A_{(n-2,2)}=\{(1^n),(2,1^{n-2}),(2,2,1^{n-4}),(n-2,2)\},

with cover chain

(1n)I(2,1n2)I(2,2,1n4)I(n2,2).(1^n)\lessdot_I(2,1^{n-2})\lessdot_I(2,2,1^{n-4})\lessdot_I(n-2,2).

Determining such intervals clarifies the immersion poset and the Schur-positivity of associated interval power sums; this claim is presented as a conjecture in the paper and remains open.

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

Lisa Johnston, David Kenepp, Evuilynn Nguyen, Digjoy Paul, Anne Schilling, Mary Claire Simone and Regina Zhou, “The immersion poset on partitions”, arXiv:2404.07393 (2024).

Solutions 0

No solutions have been posted yet.