Related papers: A filtration question on Belyi pairs and dessins
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…
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…
Brane tilings, sometimes called dimer models, are a class of bipartite graphs on a torus which encode the gauge theory data of four-dimensional SCFTs dual to D3-branes probing toric Calabi--Yau threefolds. An efficient way of encoding this…
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…
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…
For a Belyi function $\beta:\mathbb C\mathbb P^1\rightarrow \mathbb C\mathbb P^1$ ramified only over the points $-1,1,\infty$, a corresponding ``dessin d'enfant'' $\mathcal D_{\beta}$ is defined as the set $\beta^{-1}([-1,1])$ considered as…
The paper is an attempt to apply the theory of dessins d'enfants to the theory of fullerenes. The classical results concerning the calculation of the dodecahedron Belyi function are presented and then applied to the calculation of the Belyi…
In this work all the dessins d'enfant with no more than 4 edges are listed and their Belyi pairs are computed. In order to enumerate all dessins the technique of matrix model computations was used. The total number of dessins is 134; among…
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…
A dessin d'enfant, or dessin, is a bicolored graph embedded into a Riemann surface, and the monodromy group is an algebraic invariant of the dessin generated by rotations of edges about black and white vertices. A rational billiards surface…
A map is a 2-cell decomposition of an orientable closed surface. A dessin is a bipartite map with a fixed colouring of vertices. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts transitively on the…
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…
We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of…
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…
Let E be a finite set. Given permutations x and y of E that together generate a transitive subgroup, for which s is it true that x and the conjugate of y by s also generate a transitive subgroup? Such transitive permutation pairs encode…
A dessin d'enfant, or dessin, is a bicolored graph embedded into a Riemann surface, and the monodromy group is an algebraic invariant of the dessin generated by rotations of edges about black and white vertices. A rational polygonal…
It is well known that there is a bijective correspondence between metric ribbon graphs and compact Riemann surfaces with meromorphic Strebel differentials. In this article, it is proved that Grothendieck's correspondence between dessins…
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…
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…