In this paper, in the context of the “dessins d’enfants” theory, we give a combinatorial criterion for a plane tree to cover a tree from the classes of “chains” or “stars.” We also discuss some applications of this result that are related to the arithmetical theory of torsion on curves.
Similar content being viewed by others
References
E. F. Flynn, “The arithmetic of hyperelliptic curves,” in: Algorithms in Algebraic Geometry and Applications, Progress Math., Vol. 143, Birkhäuser, Boston (1996), pp. 165–175.
F. Leprévost, “Famille de courbes hyperelliptique de genre g munies d’une classe de diviseurs rationnels d’ordre 2g2 + 4g + 1,” in: Séminaire de Théorie des Nombres, Paris, France, 1991–1992, Progress Math., Vol. 116, Birkhäuser, Boston (1994), pp. 107–119.
B. Mazur, “Rational points on modular curves,” in: Modular Functions of One Variable. V, Lecture Notes Math., Vol. 601, Springer, Berlin (1977), pp. 107–148.
L. Merel, “Bornes pour la torsion des courbes elliptiques sur les corps de nombres,” Invent. Math., 124, No. 1–3, 437–449 (1996).
F. Pakovitch, “Combinatoire des arbres planaires et arithmétique des courbes hyperelliptiques,” Ann. Inst. Fourier, 48, No. 2, 1001–1029 (1998).
F. Pakovich, “On trees admitting morphisms onto hedgehogs or onto chains,” Usp. Mat. Nauk, 55, No. 3, 593–594 (2000).
L. Schneps, ed., The Grothendieck Theory of Dessins D’enfants, London Math. Soc. Lect. Note Ser., Vol. 200, Cambridge Univ. Press (1994).
L. Schneps and P. Lochak, eds., Geometric Galois Actions, Vol. 1, Around Grothendieck’s Esquisse d’un Programme, Vol. 2, The Inverse Galois Problem, Moduli Spaces and Mapping Class Groups, London Math. Soc. Lect. Note Ser., Vols. 242, 243, Cambridge Univ. Press, Cambridge (1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 6, pp. 207–215, 2007.
Rights and permissions
About this article
Cite this article
Pakovich, F.B. On trees covering chains or stars. J Math Sci 158, 148–154 (2009). https://doi.org/10.1007/s10958-009-9370-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-009-9370-x