Paper detail

Another proof of Harer-Zagier formula

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 by using the multidimensional Gaussian integrals. Soon after Jackson and later Zagier found alternative proofs that used the symmetric group characters. In this note we give a different, characters-based, proof. Its core is computing and marginally inverting Fourier transform of the underlying probability measure on $S_{2n}$. Aside from Murnaghan-Nakayama rule for one-hook diagrams, the counting techniques we use are of elementary, combinatorial nature.