paper

Complete regular dessins and skew-morphisms of cyclic groups

arXiv:1806.07024

Abstract

A dessin is a 2-cell embedding of a connected -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 study regular dessins whose underlying graph is a complete bipartite graph , called -complete regular dessins. The purpose is to establish a rather surprising correspondence between -complete regular dessins and pairs of skew-morphisms of cyclic groups. A skew-morphism of a finite group is a bijection that satisfies the identity for some function and fixes the neutral element of~. We show that every -complete regular dessin determines a pair of reciprocal skew-morphisms of the cyclic groups and . Conversely, can be reconstructed from such a reciprocal pair. As a consequence, we prove that complete regular dessins, exact bicyclic groups with a distinguished pair of generators, and pairs of reciprocal skew-morphisms of cyclic groups are all in one-to-one correspondence. Finally, we apply the main result to determining all pairs of integers and for which there exists, up to interchange of colours, exactly one -complete regular dessin. We show that the latter occurs precisely when every group expressible as a product of cyclic groups of order and is abelian, which eventually comes down to the condition , where is Euler's totient function.

19papges