Geodesic
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) (2014).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2014_special_265_a49,
     author = {Carrell, Sean and Chapuy, Guillaume},
     title = {A simple recurrence formula for the number of rooted maps on surfaces by edges and genus},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)},
     year = {2014},
     doi = {10.46298/dmtcs.2424},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2424/}
}
TY  - JOUR
AU  - Carrell, Sean
AU  - Chapuy, Guillaume
TI  - A simple recurrence formula for the number of rooted maps on surfaces by edges and genus
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2424/
DO  - 10.46298/dmtcs.2424
LA  - en
ID  - DMTCS_2014_special_265_a49
ER  - 
%0 Journal Article
%A Carrell, Sean
%A Chapuy, Guillaume
%T A simple recurrence formula for the number of rooted maps on surfaces by edges and genus
%J Discrete mathematics & theoretical computer science
%D 2014
%V DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2424/
%R 10.46298/dmtcs.2424
%G en
%F DMTCS_2014_special_265_a49
Carrell, Sean; Chapuy, Guillaume. A simple recurrence formula for the number of rooted maps on surfaces by edges and genus. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) (2014). doi : 10.46298/dmtcs.2424. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2424/

Cité par Sources :