相关论文: Children's Drawings and the Riemann-Hilbert Proble…
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…
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 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 consider N=2 supersymmetric gauge theories perturbed by tree level superpotential terms near isolated singular points in the Coulomb moduli space. We identify the Seiberg-Witten curve at these points with polynomial equations used to…
\textit{Dessins d'enfants} (hypermaps) are useful to describe algebraic properties of the Riemann surfaces they are embedded in. In general, it is not easy to describe algebraic properties of the surface of the embedding starting from the…
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 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…
The connections amongst (1) quivers whose representation varieties are Calabi-Yau, (2) the combinatorics of bipartite graphs on Riemann surfaces, and (3) the geometry of mirror symmetry have engendered a rich subject at whose heart is the…
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…
In this paper, we associate a finite dimensional algebra, called a Brauer graph algebra, to every clean dessin d'enfant by constructing a quiver based on the monodromy of the dessin. We show that Galois conjugate dessins d'enfants give rise…
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…
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…
A tree, embedded into plane, is a dessin d'enfant and its Belyi function is a polynomial --- Shabat polynomial. The Zapponi form of this polynomial is unique, so we can correspond to an embedded tree the Julia set of its Shabat-Zapponi…
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…
A dessin d'enfant, or dessin, is a bicolored graph embedded into a Riemann surface. Acyclic dessins can be described analytically by pre-images of certain polynomials, called Shabat polynomials, and also algebraically by their monodromy…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
This survey presents some combinatorial problems with number-theoretic flavor. Our journey starts from a simple graph coloring question, but at some point gets close to a dangerous territory of the Riemann Hypothesis. We will mostly focus…
In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…
We show that the absolute Galois group acts faithfully on the set of Hubbard trees. Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the…
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''. Besides, we discuss some applications of this result which are…