Skip to main navigation Skip to search Skip to main content

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

Research output: Contribution to conferencePaperpeer-review

Abstract

We look at the number of permutations β of [N] with m cycles such that (1 2.. N) β -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.

Original languageEnglish
Pages713-724
Number of pages12
Publication statusPublished - 1 Dec 2010
Event22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10 - San Francisco, CA, United States
Duration: 2 Aug 20106 Aug 2010

Conference

Conference22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10
Country/TerritoryUnited States
CitySan Francisco, CA
Period2/08/106/08/10

Keywords

  • Bicolored maps
  • Kerov's character polynomials
  • Long cycle factorization

Fingerprint

Dive into the research topics of 'Linear coefficients of Kerov's polynomials: Bijective proof and refinement of Zagier's result'. Together they form a unique fingerprint.

Cite this