Another proof of the Harer-Zagier formula

Boris Pittel¹

¹Ohio State University

The electronic journal of combinatorics, Tome 23 (2016) no. 1

Résumé

For a regular $2n$-gon there are $(2n-1)!!$ ways to match and glue the $2n$ sides. The Harer-Zagier bivariate generating function enumerates the gluings by $n$ and the genus $g$ of the attendant surface and leads to a recurrence equation for the counts of gluings with parameters $n$ and $g$. This formula was originally obtained using multidimensional Gaussian integrals. Soon after, Jackson and later Zagier found alternative proofs using symmetric group characters. In this note we give a different, characters-based, proof. Its core is computing and marginally inverting the Fourier transform of the underlying probability measure on $S_{2n}$. A key ingredient is the Murnaghan-Nakayama rule for the characters associated with one-hook Young diagrams.

Détail

DOI : 10.37236/5420

Classification : 05A15, 05A16, 05A19, 05D40, 05E10, 20P05, 60B15
Mots-clés : surfaces, chord diagrams, genus, random permutations, Fourier transform, irreducible characters, Murnaghan-Nakayama, generating functions