SearcharxivSearch

arXiv · 2506.11626

Recursive characterisation of skew morphisms of finite cyclic groups

Abstract

A skew morphism of a finite group $G$ is an element $\varphi$ of $\mathrm{Sym}(G)$ preserving the identity element of $G$ and having the property that for each $a\in G$ there exists a non-negative integer $i_a$ such that $\varphi(ab)=\varphi(a)\varphi^{i_a}(b)$ for all $b\in G$. In this paper we show that if a skew morphism $\varphi$ of $\mathbb{Z}_n$ is not an automorphism of $\mathbb{Z}_n$, then it is uniquely determined by a triple $(h,\alpha,\beta)$ where $h$ is an element of $\mathbb{Z}_n$, $\alpha$ is a skew morphism of $\mathbb{Z}_a$ where $a<n$, and $\beta$ is a skew morphism of $\mathbb{Z}_b$ where either $b<n$, or $b=n$ and $|\langle \beta\rangle| <|\langle \varphi\rangle|$. Conversely, we also list necessary and sufficient conditions for a triple $(h,\alpha,\beta)$ to define a skew morphism of a given cyclic group. In particular, this gives a recursive characterisation of skew morphisms for all finite cyclic groups. We use this characterisation to prove new theorems about skew morphisms of cyclic groups and to generate a census of all skew morphisms for cyclic groups of order up to $2000$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin Bachratý, Michal Hagara. 2025-06-13. Recursive characterisation of skew morphisms of finite cyclic groups. https://arxiv.org/abs/2506.11626

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