Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps) (Q1092921): Difference between revisions

The enumeration of maps on the torus was briefly discussed in [\textit{W. Brown}, Mem. Am. Math. Soc. 65, 1-42 (1966; Zbl 0149.212)], and an algorithm for counting rooted toroidal maps by number of vertices and edges was presented by the reviewer in [\textit{T. R. S. Walsh} and \textit{A. B. Lehman}, J. Comb. Theory, Ser. B 13, 192-218 (1972; Zbl 0228.05108)]. A generating function for counting rooted toroidal maps by number of edges was presented in [\textit{E. A. Bender, E. A. Canfield} and \textit{R. W. Robinson}, ``The enumeration of maps on the torus and the projective plane'', Can. Math. Bull. (to appear)]. Independently of [Bender et al., op. cit.], the paper under review finds not only generating functions but also explicit formulae for counting rooted toroidal maps, both by number of edges and vertices and by number of edges alone. The formula for n-edged maps is quoted to show its simplicity: \[ \sum^{n-2}_{k=0}2^{n-3-k}(3^{n-1}-3^ k)\left( \begin{matrix} n+k\\ k\end{matrix} \right). \] The author promises to count rooted maps of arbitrary orientable genus. The reviewer hopes that the methods of the present paper and those of [Bender et al., op. cit.] can be combined to solve the non-orientable case as well.