Related papers: Dessins on Modular Curves
We present an algorithmic way of exactly computing Belyi functions for hypermaps and triangulations in genus 0 or 1, and the associated dessins, based on a numerical iterative approach initialized from a circle packing combined with…
We introduce dessins d'enfants from the various existing points of view: As topological covering spaces, as surfaces with triangulations, and as algebraic curves with functions ramified over three points. We prove Belyi's theorem that such…
Riemann's Existence Theorem gives the following bijections: (1) Isomorphism classes of Belyi maps of degree $d$. (2) Equivalence classes of generating systems of degree $d$. (3) Isomorphism classes of dessins d'enfants with $d$ edges. In…
We obtain an explicit formula for the number of Lam\'e equations (modulo scalar equivalence) with index $n$ and projective monodromy group of order $2N$, for given $n \in \Z$ and $N \in \N$. This is done by performing the combinatorics of…
A part of Grothendieck's program for studying the Galois group $G_{\mathbb Q}$ of the field of all algebraic numbers $\overline{\mathbb Q}$ emerged from his insight that one should lift its action upon $\overline{\mathbb Q}$ to the action…
A tool package for computing genus 0 Belyi functions is presented, including simplification routines, computation of moduli fields, decompositions, dessins d'enfant. The main algorithm for computing the Belyi functions themselves is based…
We study the absolute Galois group by looking for invariants and orbits of its faithful action on Grothendieck's dessins d'enfants. We define a class of functions called Belyi-extending maps, which we use to construct new Galois invariants…
Determining Fourier coefficients of modular forms of a finite index noncongruence subgroups of the modular group is still a non-trivial task. In this brief note we describe a new algorithm to reliably calculate an approximation for a…
We study the action of $\operatorname{Gal}(\overline{\mathbb{Q}}/\mathbb{Q})$ on the category of Belyi functions (finite, \'{e}tale covers of $\mathbb{P}^1_{\overline{\mathbb{Q}}}\setminus \{0,1,\infty\}$). We describe a new combinatorial…
We start discussing the group of automorphisms of the field of complex numbers, and describe, in the special case of polynomials with only two critical values, Grothendieck's program of 'Dessins d' enfants', aiming at giving representations…
Dessin d'enfants (French for children's drawings) serve as a unique standpoint of studying classical complex analysis under the lens of combinatorial constructs. A thorough development of the background of this theory is developed with an…
Modular curves like X_0(N) and X_1(N) appear very frequently in arithmetic geometry. While their complex points are obtained as a quotient of the upper half plane by some subgroups of SL_2(Z), they allow for a more arithmetic description as…
In this article we consider rational functions on algebraic curves, which have one zero and one pole (and call pair of such function and curve Abel pair). We investigate moduli spaces of such functions on curves of genus one; the number of…
In this paper, we explicitly compute two kinds of algebraic Belyi functions on Bring's curve. One is related to a congruence subgroup of ${\rm SL}_2(\mathbb{Z})$ and the other is related to a congruence subgroup of the triangle group…
Dessin d'Enfants on elliptic curves are a powerful way of encoding doubly-periodic brane tilings, and thus, of four-dimensional supersymmetric gauge theories whose vacuum moduli space is toric, providing an interesting interplay between…
We provide a unified framework of Mahler measure, dessins d'enfants, and gauge theory. With certain physically motivated Newton polynomials from reflexive polygons, the Mahler measure and the dessin are in one-to-one correspondence. From…
We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic…
We apply machine-learning to the study of dessins d'enfants. Specifically, we investigate a class of dessins which reside at the intersection of the investigations of modular subgroups, Seiberg-Witten curves and extremal elliptic K3…
We exhibit an algorithm that, given input a curve $X$ over a number field, computes as output the minimal degree of a Belyi map $X \to \mathbb{P}^1$.
We consider an application of Grothendieck's dessins d'enfants to the theory of the sixth Painlev\'e and Gauss hypergeometric functions: two classical special functions of the isomonodromy type. It is shown that, higher order…