Discrete Mathematics & Theoretical Computer Science |

- 1 Laboratoire Bordelais de Recherche en Informatique
- 2 Laboratoire d'informatique de l'École polytechnique [Palaiseau]

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.

Source: HAL:hal-01186243v1

Volume: DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)

Section: Proceedings

Published on: January 1, 2010

Imported on: January 31, 2017

Keywords: Kerov's Character Polynomials,Bicolored Maps,Long Cycle Factorization,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 198 times.

This article's PDF has been downloaded 172 times.