For every poset, the noncommutative chromatic function of its incomparability graph is the omega image of the noncommutative Redei-Berge function, making the two theories interchangeable.
Chromatic symmetric functions and change of basis
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We prove necessary conditions for certain elementary symmetric functions, $e_\lambda$, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the generalization considered by Shareshian and Wachs. We do this by first considering the expansion in the monomial or Schur basis and then performing a basis change. Using the former, we make a connection with two fundamental graph theory invariants, the independence and clique numbers. This allows us to prove nonnegativity of three-column coefficients for all natural unit interval graphs. The Schur basis permits us to give a new interpretation of the coefficient of $e_n$ in terms of tableaux. We are also able to give an explicit formula for that coefficient.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The connection between the chromatic function and the Redei-Berge function
For every poset, the noncommutative chromatic function of its incomparability graph is the omega image of the noncommutative Redei-Berge function, making the two theories interchangeable.