McNamara–van Willigenburg's factorization conjecture for equivalent skew diagrams

About 2 years old · traced to

Let D\mathcal{D} and E\mathcal{E} be skew diagrams, and let D∗\mathcal{D}^* denote the diagram obtained from D\mathcal{D} by rotation through 180 degrees. Write Ei=WiOiWi\mathcal{E}_i=W_iO_iW_i when this decomposition is applicable, and let ∘Wi\circ_{W_i} denote the operation used to combine skew diagrams along WiW_i. Two skew diagrams are equivalent when D∼E\mathcal{D}\sim\mathcal{E}, meaning that their skew Schur functions satisfy sD=sEs_{\mathcal{D}}=s_{\mathcal{E}}. For some rr, suppose

D=(⋯((E1∘W2E2)∘W3E3)⋯ )∘WrEr\mathcal{D}=(\cdots((\mathcal{E}_1\circ_{W_2}\mathcal{E}_2)\circ_{W_3}\mathcal{E}_3)\cdots)\circ_{W_r}\mathcal{E}_r

and

E=(⋯((E1′∘W2′E2′)∘W3′E3′)⋯ )∘Wr′Er′.\mathcal{E}=(\cdots((\mathcal{E}'_1\circ_{W'_2}\mathcal{E}'_2)\circ_{W'_3}\mathcal{E}'_3)\cdots)\circ_{W'_r}\mathcal{E}'_r.

McNamara–van Willigenburg's conjecture. The diagrams D\mathcal{D} and E\mathcal{E} satisfy D∼E\mathcal{D}\sim\mathcal{E} if and only if the factors satisfy: E1,…,Er\mathcal{E}_1,\ldots,\mathcal{E}_r are skew diagrams; for 2≤i≤r2\leq i\leq r, Ei=WiOiWi\mathcal{E}_i=W_iO_iW_i satisfies Hypotheses I--IV; E1′=E1\mathcal{E}'_1=\mathcal{E}_1 or E1′=E1∗\mathcal{E}'_1=\mathcal{E}_1^*; and for 2≤i≤r2\leq i\leq r, (Ei′,Wi′)=(Ei,Wi)(\mathcal{E}'_i,W'_i)=(\mathcal{E}_i,W_i) or (Ei′,Wi′)=(Ei∗,Wi∗)(\mathcal{E}'_i,W'_i)=(\mathcal{E}_i^*,W_i^*). Moreover, the equivalence class of D\mathcal{D} contains 2κ2^\kappa elements, where κ\kappa counts factors Ei\mathcal{E}_i in any irreducible factorization of D\mathcal{D} for which Ei≠Ei∗\mathcal{E}_i\neq\mathcal{E}_i^*. This conjecture would characterize equivalence classes of skew diagrams using the sufficient conditions previously established by McNamara and van Willigenburg; the source gives no evidence of resolution, so its status remains open.

References

Primary source

Emma Yu Jin and Shu Xiao Li, “Towards equivalent thickened ribbon Schur functions”, arXiv:2403.01843 (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.