Powerful tableau noncommutative upper-bound conjecture

Let PP be a (3+1)(\mathbf{3}+\mathbf{1})-free poset, let λn\lambda\vdash n, and let mλP(u)m_\lambda^P(\mathbf{u}) be the relevant noncommutative elementary coefficient in RP=Qu1,u2,,un/IP\mathcal{R}_P=\mathbb{Q}\langle u_1,u_2,\ldots,u_n\rangle/I_P. For a tableau TT, let colword(T)\operatorname{colword}(T) denote its column word, and let ucolword(T)\mathbf{u}_{\operatorname{colword}(T)} be the corresponding word. Powerful tableau noncommutative upper-bound conjecture. The element

(TpowSSYTP(λ)ucolword(T))mλP(u)\left(\sum_{T\in\operatorname{powSSYT}_P(\lambda)}\mathbf{u}_{\operatorname{colword}(T)}\right)-m_\lambda^P(\mathbf{u})

has a u\mathbf{u}-positive expansion in RP\mathcal{R}_P. This is a noncommutative refinement of the proposed powerful-tableau upper bound.

Sources & referencesView supporting material

Primary source

Isaiah Siegl, “Toward Lower Bounds for Chromatic Symmetric Functions in the Elementary Basis”, arXiv:2509.02841 (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.