C-positivity conjecture for the graded Kerov character polynomials

From papers

Let R(x)=1+i2RixiR(x)=1+\sum_{i\geq 2}R_ix^i, and define CmC_m by C0=1C_0=1, C1=0C_1=0, and

Cm=j2,j3,02j2+3j3+=m(j2+j3+)!i2((i1)Ri)jiji!,m2.C_m=\sum_{\substack{j_2,j_3,\ldots\geq 0\\2j_2+3j_3+\cdots=m}}(j_2+j_3+\cdots)!\prod_{i\geq 2}\frac{((i-1)R_i)^{j_i}}{j_i!},\qquad m\geq 2.

For n0n\geq 0, let Σk,2n\Sigma_{k,2n} be the sum of the terms of weight k+12nk+1-2n in Σk\Sigma_k. A polynomial in the CmC_m is C-positive when all its nonzero coefficients are positive. C-positivity conjecture. For n1n\geq 1 and k2n1k\geq 2n-1, Σk,2n\Sigma_{k,2n} is C-positive. The conjecture is based on computations through k=25k=25; the explicit formula for Σk,2\Sigma_{k,2} gives the first nontrivial case, while positivity for general nn and kk remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

I. P. Goulden and A. Rattan, “An explicit form for Kerov's character polynomials”, arXiv:math/0505317 (2005).

Solutions 0

No solutions have been posted yet.