Geodesic
Catalog of dessins d'enfants with no more than 4 edges
Fundamentalʹnaâ i prikladnaâ matematika, Tome 13 (2007) no. 6, pp. 35-112 
N. M. Adrianov; N. Ya. Amburg; V. A. Dremov; Yu. Yu. Kochetkov; E. M. Kreines; Yu. A. Levitskaya; V. F. Nasretdinova; G. B. Shabat. Catalog of dessins d'enfants with no more than 4 edges. Fundamentalʹnaâ i prikladnaâ matematika, Tome 13 (2007) no. 6, pp. 35-112. http://geodesic.mathdoc.fr/item/FPM_2007_13_6_a3/
@article{FPM_2007_13_6_a3,
     author = {N. M. Adrianov and N. Ya. Amburg and V. A. Dremov and Yu. Yu. Kochetkov and E. M. Kreines and Yu. A. Levitskaya and V. F. Nasretdinova and G. B. Shabat},
     title = {Catalog of dessins d'enfants with no more than 4~edges},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {35--112},
     year = {2007},
     volume = {13},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2007_13_6_a3/}
}
TY  - JOUR
AU  - N. M. Adrianov
AU  - N. Ya. Amburg
AU  - V. A. Dremov
AU  - Yu. Yu. Kochetkov
AU  - E. M. Kreines
AU  - Yu. A. Levitskaya
AU  - V. F. Nasretdinova
AU  - G. B. Shabat
TI  - Catalog of dessins d'enfants with no more than 4 edges
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2007
SP  - 35
EP  - 112
VL  - 13
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/FPM_2007_13_6_a3/
LA  - ru
ID  - FPM_2007_13_6_a3
ER  - 
%0 Journal Article
%A N. M. Adrianov
%A N. Ya. Amburg
%A V. A. Dremov
%A Yu. Yu. Kochetkov
%A E. M. Kreines
%A Yu. A. Levitskaya
%A V. F. Nasretdinova
%A G. B. Shabat
%T Catalog of dessins d'enfants with no more than 4 edges
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2007
%P 35-112
%V 13
%N 6
%U http://geodesic.mathdoc.fr/item/FPM_2007_13_6_a3/
%G ru
%F FPM_2007_13_6_a3

Voir la notice de l'article provenant de la source Math-Net.Ru

In this work, all the dessins d'enfants with no more than 4 edges are listed and their Belyi pairs are computed. In order to enumerate all dessins, the technique of matrix model computations was used. The total number of dessins is 134; among them 77 are spherical, 53 of genus 1, and 4 of genus 2. The automorphism groups of all the dessins are also found. Dessins are listed by the number of edges. Dessins with the same number of edges are ordered lexicographically by their lists of 0-valencies. The corresponding matrix model for any list of 0-valencies is given and computed. Complex matrix models for dessins with 1–3 edges are used. For the dessins with 4 edges, we use Hermitian matrix model.

[1] Alexandrov A., Mironov A., Morozov A., “Partition functions of matrix models as the first special functions of string theory. I. Finite size Hermitean 1-matrix model”, Internat. J. Modern Phys. A, 19 (2004), 4127–4165 ; arXiv: /hep-th/0310113 | DOI | MR

[2] Bétréma J., Péré D., Zvonkin A., Plane Trees and Their Shabat Polynomials. Catalog, Technical Report LaBRI No 92–75, Bordeaux, 1992

[3] Chada S., Mahoux G., Mehta M. L., “A method of integration over matrix variables. II”, J. Phys. A, 14 (1981), 589–586 | MR

[4] Di Francesco P., Itzykson C., A generating function for fatgraphs, Preprint, 1992

[5] Grothendieck A., “Sketch of a programme (Esquisse d'un programme)”, Geometric Galois Actions, Vol. 1: Around Grothendieck's Esquisse d'un Programme, London Math. Soc. Lect. Note Ser., 242, eds. L. Schneps, P. Lochak, Cambridge Univ. Press, Cambridge, 1997, 5–48, 243–283 | MR | Zbl

[6] Lando S. K., Zvonkin A. K., Graphs on Surfaces and Their Applications, Encyclopedia of Mathematical Sciences, 141, Springer, Berlin, 2004 | MR | Zbl