OFFSET
1,2
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-girder has n vertices and looks like:
2-4-6- -n
|\|\|\ ... \|
1-3-5- n-1
Conjecture: All terms are nonnegative (verified up to n = 10). This is a special case of Stanley and Stembridge's poset-chain conjecture.
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.
Richard P. Stanley and John R. Stembridge, On immanants of Jacobi-Trudi matrices and permutations with restricted position, Journal of Combinatorial Theory Series A 62-2 (1993), 261-279.
Gus Wiseman, Enumeration of paths and cycles and e-coefficients of incomparability graphs, arXiv:0709.0430 [math.CO], 2007.
EXAMPLE
Triangle begins:
1
2 0
6 0 0
16 0 2 0 0
40 12 2 0 0 0 0
96 16 44 6 0 0 0 0 0 0 0
224 136 66 52 2 4 0 2 0 0 0 0 0 0 0
For example, row 6 gives: X_G6 = 96e(6) + 6e(33) + 16e(42) + 44e(51).
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Nov 23 2018
STATUS
approved