arXiv Analytics

Sign in

arXiv:math/0507038 [math.CO]AbstractReferencesReviewsResources

Set maps, umbral calculus, and the chromatic polynomial

Gus Wiseman

Published 2005-07-03, updated 2007-07-05Version 2

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any polynomial sequence of binomial type. This leads to some new expansions of the chromatic polynomial. We also describe a set map generalization of Abel polynomials.

Related articles: Most relevant | Search more
arXiv:1402.0731 [math.CO] (Published 2014-02-04)
Some applications of the chromatic polynomials
arXiv:2107.08154 [math.CO] (Published 2021-07-17)
A Deletion-Contraction Relation for the DP Color Function
arXiv:1611.04245 [math.CO] (Published 2016-11-14)
Do hypergraphs have properties on chromatic polynomials not owned by graphs