循环群完全正则型与斜态射
Complete regular dessins and skew-morphisms of cyclic groups
摘要:
Dessin是连通$2$着色二部图到可定向闭曲面的2-胞腔嵌入.一个Dessin是正则的,如果它的方向和颜色保持的自同构群规则地作用在边缘上。本文研究了基图为完全二部图$K_{m,n}$的正则图,称之为$(m,n)$ -完全正则图.目的是建立一个相当令人惊讶的$(m,n)$ -完全正则dessins和对斜态射的循环群之间的对应关系。有限群$A$的斜态射是一个双射$φ\colon A\to A$,它对某个函数$π\colon A\to\mathbb{Z}$满足恒等式$φ(xy)=φ(x)φ^{π(x)}(y)$,并且固定~ $A$的中性元。我们证明了每个$(m,n)$ -完全正则设计$\mathcal{D}$确定了循环群$\mathbb{Z}_n$和$\mathbb{Z}_m$的一对互逆斜态射。相反,可以从这样的互逆对重构$\mathcal{D}$。证明了完备正则dessins,具有特殊生成元对的正合双循环群,以及循环群的互反斜态射对都是一一对应的.最后,我们应用主要结果,以确定所有对整数$m$和$n$存在,直到交换的颜色,正是一个$(m,n)$ -完全定期dessin。我们发现,后者发生时,每一个组表示为产品的循环群的顺序$m$和$n$是阿贝尔,最终归结为条件$\gcd(m,ϕ(n))=\gcd(ϕ(m),n)=1$,其中$ϕ$是欧拉的totient函数。
英文摘要:
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 study regular dessins whose underlying graph is a complete bipartite graph $K_{m,n}$, called $(m,n)$-complete regular dessins. The purpose is to establish a rather surprising correspondence between $(m,n)$-complete regular dessins and pairs of skew-morphisms of cyclic groups. A skew-morphism of a finite group $A$ is a bijection $φ\colon A\to A$ that satisfies the identity $φ(xy)=φ(x)φ^{π(x)}(y)$ for some function $π\colon A\to\mathbb{Z}$ and fixes the neutral element of~$A$. We show that every $(m,n)$-complete regular dessin $\mathcal{D}$ determines a pair of reciprocal skew-morphisms of the cyclic groups $\mathbb{Z}_n$ and $\mathbb{Z}_m$. Conversely, $\mathcal{D}$ 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 $m$ and $n$ for which there exists, up to interchange of colours, exactly one $(m,n)$-complete regular dessin. We show that the latter occurs precisely when every group expressible as a product of cyclic groups of order $m$ and $n$ is abelian, which eventually comes down to the condition $\gcd(m,ϕ(n))=\gcd(ϕ(m),n)=1$, where $ϕ$ is Euler's totient function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。