Related papers: Catalog of dessins d'enfants with \le 4 edges
Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…
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…
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 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…
We introduce a family of models, which we name matrix models associated with children's drawings -- the so-called dessin d'enfant. Dessins d'enfant are graphs of a special kind drawn on a closed connected orientable surface (in the sky).…
Let $N$ be a positive integer. For any positive integer $L\leq N$ and any positive divisor $r$ of $N$, we enumerate the equivalence classes of dessins d'enfants with $N$ edges, $L$ faces and two vertices whose automorphism groups are cyclic…
For a smooth algebraic curve defined over a number field, one can associate a bipartite graph known as a dessin d'enfant. In this paper, we investigate the regularity and automorphism groups of dessins d'enfants with uniform passports, that…
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…
A Bely\u{\i} pair is a holomorphic map from a Riemann surface to $S^2$ with additional properties. A dessin d'enfants is a bipartite graph with additional structure. It is well know that there is a bijection between Bely\u{i} pairs and…
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…
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…
Grothendieck's dessins d'enfants arise with ever-increasing frequency in many areas of 21st century mathematical physics. In this paper, we review the connections between dessins and the theory of Hecke groups. Focussing on the restricted…
Classification of planar unit-distance graphs with up to 9 edges, by homeomorphism and isomorphism classes. With exactly nine edges, there are 633 nonisomorphic connected matchstick graphs, of which 196 are topologically distinct from each…
Given a finite index subgroup $\Gamma$ of ${\rm{PSL}}_2(\Bbb{Z})$, we investigate Belyi functions on the corresponding modular curve $X(\Gamma)$ by introducing two methods for constructing such functions. Numerous examples have been worked…
The classical theory of dessin d'enfants, which are bipartite maps on compact orientable surfaces, are combinatorial objects used to study branched covers between compact Riemann surfaces and the absolute Galois group of the field of…
Given a map $\mathcal M$ on a connected and closed orientable surface, the delta-matroid of $\mathcal M$ is a combinatorial object associated to $\mathcal M$ which captures some topological information of the embedding. We explore how…
We present the matrix models that are the generating functions for branched covers of the complex projective line ramified over $0$, $1$, and $\infty$ (Grotendieck's dessins d'enfants) of fixed genus, degree, and the ramification profile at…
A dessin is a $2$-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper…
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…
A dessin is a 2-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving automorphisms acts regularly on the edges. In this paper we…