Chromatic Symmetric Functions of Hypertrees
Jair Taylor

TL;DR
This paper identifies a class of hypertrees with prime-sized edges for which the chromatic symmetric function is positive in fundamental quasisymmetric functions, providing a combinatorial interpretation for the coefficients.
Contribution
It introduces hypertrees with prime-sized edges as a class where the chromatic symmetric function is F-positive and offers an explicit combinatorial interpretation.
Findings
Chromatic symmetric function is F-positive for hypertrees with prime-sized edges.
Provides a combinatorial interpretation for F-coefficients.
Extends understanding of chromatic symmetric functions beyond ordinary graphs.
Abstract
The chromatic symmetric function of a hypergraph is the generating function for all colorings of so that no edge is monochromatic. When is an ordinary graph, it is known that is positive in the fundamental quasisymmetric functions , but this is not the case for general hypergraphs. We exhibit a class of hypergraphs --- hypertrees with prime-sized edges --- for which is -positive, and give an explicit combinatorial interpretation for the -coefficients of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
