English

A complete multipartite basis for the chromatic symmetric function

Combinatorics 2021-11-16 v2

Abstract

In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, the functions {rλ:λ an integer partition}\{r_{\lambda}: \lambda \text{ an integer partition}\} defined as chromatic symmetric functions of complete multipartite graphs. This basis was first introduced by Penaguiao [21]. We provide a combinatorial interpretation for the coefficients of the change-of-basis formula between the rλr_{\lambda} and the monomial symmetric functions, and we show that the coefficients of the chromatic and Tutte symmetric functions of a graph GG when expanded in the rr-basis enumerate certain intersections of partitions of V(G)V(G) into stable sets.

Keywords

Cite

@article{arxiv.2009.14141,
  title  = {A complete multipartite basis for the chromatic symmetric function},
  author = {Logan Crew and Sophie Spirkl},
  journal= {arXiv preprint arXiv:2009.14141},
  year   = {2021}
}

Comments

Accepted manuscript; see DOI for journal version

R2 v1 2026-06-23T18:53:07.479Z