Another proof of the Harer-Zagier formula
zbMath1330.05017arXiv1503.05598MaRDI QIDQ2635085
Publication date: 11 February 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.05598
Fourier transformgenerating functionsirreducible characterssurfacesgenusrandom permutationschord diagramsMurnaghan-Nakayama
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of representation theory (05E10) Asymptotic enumeration (05A16) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Probabilistic methods in group theory (20P05)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The expected genus of a random chord diagram
- Poisson-Dirichlet distribution for random Belyi surfaces
- On a surface formed by randomly gluing together polygonal discs
- Matrix integration and combinatorics of modular groups
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- The genus of a random chord diagram is asymptotically normal
- The Euler characteristic of the moduli space of curves
- Two enumerative results on cycles of permutations
- Démonstration combinatoire de la formule de Harer–Zagier
- Large deviations and moments for the Euler characteristic of a random surface
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Generating a random permutation with random transpositions
- Topological characteristics of random triangulated surfaces
This page was built for publication: Another proof of the Harer-Zagier formula