Search arXivSearch

arXiv · 1806.07023

Smooth skew-morphisms of the dihedral groups

Abstract

A skew-morphism $\varphi$ of a finite group $A$ is a permutation on $A$ such that $\varphi(1)=1$ and $\varphi(xy)=\varphi(x)\varphi^{\pi(x)}(y)$ for all $x,y\in A$ where $\pi:A\to\mathbb{Z}_{|\varphi|}$ is an integer function. A skew-morphism is smooth if $\pi(\varphi(x))=\pi(x)$ for all $x\in A$. The concept of smooth skew-morphisms is a generalization of that of $t$-balanced skew-morphisms. The aim of the paper is to develop a general theory of smooth skew-morphisms. As an application we classify smooth skew-morphisms of the dihedral groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Naer Wang, Kan Hu, Kai Yuan, Junyang Zhang. 2018-06-19. Smooth skew-morphisms of the dihedral groups. https://arxiv.org/abs/1806.07023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR