Skip to Main content Skip to Navigation
Conference papers

A simple recurrence formula for the number of rooted maps on surfaces by edges and genus

Abstract : We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was apparently unnoticed before. It gives by far the fastest known way of computing these numbers, or the fixed-genus generating functions, especially for large $g$. The formula is similar in look to the one discovered by Goulden and Jackson for triangulations (although the latter does not rely on an additional Tutte equation). Both of them have a very combinatorial flavour, but finding a bijective interpretation is currently unsolved - should such an interpretation exist, the history of bijective methods for maps would tend to show that the case treated here is easier to start with than the one of triangulations.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01207551
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, October 1, 2015 - 9:28:15 AM
Last modification on : Saturday, March 28, 2020 - 2:17:27 AM
Long-term archiving on: : Saturday, January 2, 2016 - 10:38:10 AM

File

dmAT0150.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01207551, version 1

Collections

Citation

Sean Carrell, Guillaume Chapuy. A simple recurrence formula for the number of rooted maps on surfaces by edges and genus. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.573-584. ⟨hal-01207551⟩

Share

Metrics

Record views

122

Files downloads

778