Résumé
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.
| langue originale | Anglais |
|---|---|
| Pages | 713-724 |
| Nombre de pages | 12 |
| état | Publié - 1 déc. 2010 |
| Evénement | 22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10 - San Francisco, CA, États-Unis Durée: 2 août 2010 → 6 août 2010 |
Une conférence
| Une conférence | 22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10 |
|---|---|
| Pays/Territoire | États-Unis |
| La ville | San Francisco, CA |
| période | 2/08/10 → 6/08/10 |
Empreinte digitale
Examiner les sujets de recherche de « Linear coefficients of Kerov's polynomials: Bijective proof and refinement of Zagier's result ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver