English

Chromatic symmetric function of graphs from Borcherds algebras

Combinatorics 2021-05-21 v2

Abstract

Let g\mathfrak g be a Borcherds algebra with the associated graph GG. We prove that the chromatic symmetric function of GG can be recovered from the Weyl denominator identity of g\mathfrak g and this gives a Lie theoretic proof of Stanley's expression for chromatic symmetric function in terms of power sum symmetric function. Also, this gives an expression for chromatic symmetric function of GG in terms of root multiplicities of \lieg\lie g. The absolute value of the linear coefficient of the chromatic polynomial of GG is known as the chromatic discriminant of GG. As an application of our main theorem, we prove that graphs with different chromatic discriminants are distinguished by their chromatic symmetric functions. Also, we find a connection between the Weyl denominators and the GG-elementary symmetric functions. Using this connection, we give a Lie theoretic proof of non-negativity of coefficients of GG-power sum symmetric functions.

Keywords

Cite

@article{arxiv.1908.08198,
  title  = {Chromatic symmetric function of graphs from Borcherds algebras},
  author = {G. Arunkumar},
  journal= {arXiv preprint arXiv:1908.08198},
  year   = {2021}
}

Comments

arXiv admin note: text overlap with arXiv:1612.01320

R2 v1 2026-06-23T10:53:54.604Z