×

The Belyi characterization of a class of modular curves. (English. French summary) Zbl 1453.14088

Summary: A class of modular curves is characterized by the existence of certain pairs of Belyi functions which generate their function fields. Applications to the modular equation and the computation of special values of the \(j\)-function are given.

MSC:

14H57 Dessins d’enfants theory
11F03 Modular and automorphic functions
14Q05 Computational aspects of algebraic curves
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Khashayar Filom & Ali Kamalinejad, “Dessins on Modular Curves”, , 2016
[2] Ernesto Girondo & Gabino Gonzàlez-Diez, Introduction to Compact Riemann Surfaces and Dessins d’Enfants, London Mathematical Society Student Texts 79, Cambridge University Press, 2012 · Zbl 1253.30001
[3] Yang-Hui He, John McKay & James Read, Modular subgroups, dessins d’enfants and elliptic \(\operatorname{K} 3\) surfaces, LMS J. Comput. Math.16 (2013), p. 271-318 · Zbl 1298.11058
[4] Sergei K. Lando & Alexander K. Zvonkin, Graphs on Surfaces and Their Applications, Encyclopaedia of Mathematical Sciences 141, Springer, 2004 · Zbl 1040.05001
[5] John McKay & Abdellah Sebbar, J-invariants of arithmetic semistable elliptic surfaces and graphs, Proceedings on Moonshine and related topics (Montréal, 1999), CRM Proceedings & Lecture Notes 30, American Mathematical Society, 2001, p. 119-130 · Zbl 1191.11010
[6] James Stuart Milne, “Modular Functions and Modular Forms (Elliptic Modular Curves)”, , 2012
[7] Jeroen Sijsling & John Michael Voight, On computing Belyi maps, Publ. Math. Besançon, Algèbre Théor. Nombres2014 (2014), p. 73-131 · Zbl 1364.11127
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.