OFFSET
1,1
COMMENTS
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
A stable partition of a graph is a set partition of the vertices where no edge has both ends in the same block. The chromatic symmetric function is given by X_G = Sum_p m(t(p)) where the sum is over all stable partitions of G, t(p) is the integer partition whose parts are the block-sizes of p, and m is augmented monomial symmetric functions (see A321895).
The n-ladder has 2*n vertices and looks like:
o-o-o- -o
| | | ... |
o-o-o- -o
Conjecture: All terms are nonnegative (verified up to the 5-ladder).
LINKS
Richard P. Stanley, A symmetric function generalization of the chromatic polynomial of a graph, Advances in Math. 111 (1995), 166-194.
Richard P. Stanley, Graph colorings and related symmetric functions: ideas and applications, Discrete Mathematics 193 (1998), 267-286.
Gus Wiseman, Enumeration of paths and cycles and e-coefficients of incomparability graphs, arXiv:0709.0430 [math.CO], 2007.
EXAMPLE
Triangle begins:
2 0
12 2 0 0 0
54 26 16 0 2 0 0 0 0 0 0
216 120 168 84 0 24 40 32 0 0 2 0 0 [+9 more zeros]
For example, row 3 gives: X_L3 = 54e(6) + 26e(42) + 16e(51) + 2e(222).
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Nov 23 2018
STATUS
approved