Related papers: Zapponi-orientable dessins d'enfants
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…
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 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…
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…
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 dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. An automorphism of a dessin is a permutation of the edges of the underlying graph which preserves the colouring of the vertices and extends to…
Recently, Gareth Jones observed that every finite group $G$ can be realized as the group of automorphisms of some dessin d'enfant ${\mathcal D}$. In this paper, complementing Gareth's result, we prove that for every possible action of $G$…
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…
A dessin is an embedding of connected bipartite graph into an oriented closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts transitively on the edges. In the present paper regular dessins…
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…
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…
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…
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…
Let $\Gamma$ be a triangulation of a connected closed $2$-dimensional (not necessarily orientable) surface. Using zigzags (closed left-right paths), for every face of $\Gamma$ we define the $z$-monodromy which acts on the oriented edges of…
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…
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…
Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…
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…
One-vertex maps (a type of dessin d'enfant) give a uniform characterization of certain well-known algebraic curves, including those of Klein, Wiman, Accola-Maclachlan and Kulkarni. The characterization depends on a new classification of…
The main objects of the paper are $z$-oriented triangulations of connected closed $2$-dimensional surfaces. A $z$-orientation of a map is a minimal collection of zigzags which double covers the set of edges. We have two possibilities for an…