Powerful tableau noncommutative upper-bound conjecture
Powerful tableau noncommutative upper-bound conjecture
Let be a -free poset, let , and let be the relevant noncommutative elementary coefficient in . For a tableau , let denote its column word, and let be the corresponding word. Powerful tableau noncommutative upper-bound conjecture. The element
has a -positive expansion in . 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
Sign in to submit a solution.
No solutions have been posted yet.