The conjecture that chromatic noncommutative symmetric functions distinguish oriented paths

From papers

Let D1D_1 and D2D_2 be non-isomorphic oriented paths. Their chromatic noncommutative symmetric functions are denoted by XD1\mathbf{X}_{D_1} and XD2\mathbf{X}_{D_2}, respectively. Oriented-path distinguishability conjecture. Non-isomorphic oriented paths have different chromatic noncommutative symmetric functions, that is, XD1XD2\mathbf{X}_{D_1}\ne\mathbf{X}_{D_2}. The authors verify computationally that chromatic noncommutative symmetric functions distinguish non-isomorphic oriented paths with up to 2424 vertices, while the general statement remains open in the supplied text.

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

Lingxiao Hao and Shenglin Zhu, “The chromatic noncommutative symmetric function of oriented trees”, arXiv:2606.03436 (2026).

Solutions 0

No solutions have been posted yet.