A new explicit formula for Kerov polynomials
Combinatorics
2009-08-11 v1 Representation Theory
Abstract
We prove a formula expressing the Kerov polynomial as a weighted sum over the lattice of noncrossing partitions of the set . In particular, such a formula is related to a partial order on the Lehner's irreducible noncrossing partitions which can be described in terms of left-to-right minima and maxima, descents and excedances of permutations. This provides a translation of the formula in terms of the Cayley graph of the symmetric group and allows us to recover the coefficients of by means of the posets and of pattern-avoiding permutations discovered by B\'ona and Simion. We also obtain symmetric functions specializing in the coefficients of .
Cite
@article{arxiv.0908.1284,
title = {A new explicit formula for Kerov polynomials},
author = {P. Petrullo and D. Senato},
journal= {arXiv preprint arXiv:0908.1284},
year = {2009}
}