Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result

Details Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result

2010-06-17

arxiv.org/abs/1006.3474v1

Mathematics

Combinatorics

12 pages. This is the final version for FPSAC 2010 proceedings

Scientific paper

We look at the number of permutations $\beta$ of $[N]$ with $m$ cycles such that $(1\ 2\ \ldots\ N) \beta^{-1}$ is a long cycle. These numbers appear as coefficients of linear monomials in Kerov's and Stanley's character polynomials. D. Zagier, using algebraic methods, found an unexpected connection with Stirling numbers of size $N+1$. We present the first combinatorial proof of his result, introducing a new bijection between partitioned maps and thorn trees. Moreover, we obtain a finer result, which takes the type of the permutations into account.

Affiliated with

Also associated with

No associations

Rating

Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-552063