Stapledon Decompositions and Inequalities for Coefficients of Chromatic Polynomials
Emerson Le\'on

TL;DR
This paper applies Stapledon’s polynomial decomposition to Ehrhart and chromatic polynomials, revealing nonnegative coefficient decompositions that lead to new inequalities for chromatic polynomial coefficients.
Contribution
It introduces a novel decomposition approach for Ehrhart and chromatic polynomials, establishing inequalities for chromatic polynomial coefficients in simple graphs.
Findings
Decomposition of Ehrhart series numerator polynomial into symmetric polynomials
Decomposition for chromatic polynomial numerator polynomial
Derivation of inequalities for chromatic polynomial coefficients
Abstract
We use a polynomial decomposition result by Stapledon to show that the numerator polynomial of the Ehrhart series of an open polytope is the difference of two symmetric polynomials with nonnegative integer coefficients. We obtain a related decomposition for order polytopes and for the numerator polynomial of the corresponding series for chromatic polynomials. The nonnegativity of the coefficients in such decompositions provide inequalities satisfied by the coefficients of chromatic polynomials for any simple graph.
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
