Related papers: Regular dessins with a given automorphism group
Let $G_{n}$ be the dicyclic group of order $4n$. We observe that, up to isomorphisms, (i) for $n \geq 2$ even there is exactly one regular dessin d'enfant with automorphism group $G_{n}$, and (ii) for $n \geq 3$ odd there are exactly two of…
It is well known that the automorphism group of a regular dessin is a two-generator finite group, and the isomorphism classes of regular dessins with automorphism groups isomorphic to a given finite group $G$ are in one-to-one…
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…
\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…
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…
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$…
In this paper, a construction of an infinite dimensional associative algebra, which will be called a \emph{Surface Algebra}, is associated in a "canonical" way to a dessin d'enfant, or more generally, a cellularly embedded graph in a…
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 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…
We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field $\bar{\mathbb{Q}}$ of algebraic numbers --- so-called Grothendieck's {\it dessins d'enfants} --- and a wealth of distinguished…
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…
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…
It is known that every finite group can be represented as the full group of automorphisms of a suitable compact dessin d'enfant. In this paper, we give a constructive and easy proof that the same holds for any countable group by considering…
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…
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 classify the dessins $\mathcal D$ for which the automorphism group $G$ acts primitively and faithfully on the points over one of the three critical values (without loss of generality the black vertices in the usual bipartite map…
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…
Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…
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…
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…