On families of geometric parasitic solutions for Belyi systems of genus zero
Fundamentalʹnaâ i prikladnaâ matematika, Tome 9 (2003) no. 1, pp. 103-111
Voir la notice de l'article provenant de la source Math-Net.Ru
This paper is devoted to interrelations between the combinatorial structure of plane graphs and algebraic properties of systems of equations related to Belyi functions for these graphs. The main purpose is to describe some families of plane graphs possessing parasitic solutions and some families of plane graphs such that each solution of the corresponding systems is not parasitic and has multiplicity one.
@article{FPM_2003_9_1_a8,
author = {E. M. Kreines},
title = {On families of geometric parasitic solutions for {Belyi} systems of genus zero},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {103--111},
publisher = {mathdoc},
volume = {9},
number = {1},
year = {2003},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2003_9_1_a8/}
}
E. M. Kreines. On families of geometric parasitic solutions for Belyi systems of genus zero. Fundamentalʹnaâ i prikladnaâ matematika, Tome 9 (2003) no. 1, pp. 103-111. http://geodesic.mathdoc.fr/item/FPM_2003_9_1_a8/