A modular relation for the chromatic symmetric functions of (3+1)-free posets
Mathieu Guay-Paquet

TL;DR
This paper introduces a modular relation called the modular law that expresses the chromatic symmetric function of a poset in terms of related posets, simplifying the proof of e-positivity for certain classes of posets.
Contribution
It develops a modular law relating chromatic symmetric functions of posets, reducing the conjecture for (3+1)-free posets to a smaller class and providing a new proof for 3-free posets.
Findings
Reduces Stanley and Stembridge's conjecture to (3+1)-and-(2+2)-free posets
Provides a new proof that all 3-free posets have e-positive chromatic symmetric functions
Introduces a modular law relating chromatic symmetric functions of related posets
Abstract
We consider a linear relation which expresses Stanley's chromatic symmetric function for a poset in terms of the chromatic symmetric functions of some closely related posets, which we call the modular law. By applying this in the context of (3+1)-free posets, we are able to reduce Stanley and Stembridge's conjecture that the chromatic symmetric functions of all (3+1)-free posets are e-positive to the case of (3+1)-and-(2+2)-free posets, also known as unit interval orders. In fact, our reduction can be pushed further to a much smaller class of posets, for which we have no satisfying characterization. We also obtain a new proof of the fact that all 3-free posets have e-positive chromatic symmetric functions.
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic structures and combinatorial models
