SearcharxivSearch

arXiv · 2604.20590

Enumeration of skew morphisms of cyclic $2$-groups

Abstract

A skew morphism of a finite group $B$ is a permutation of $B$ fixing the identity and satisfying $\varphi(xy) = \varphi(x)\varphi^{i_x}(y)$ for some integers $i_x$ indexed by $x \in B$. The enumeration of skew morphisms of finite cyclic groups remains an open problem. The most substantial progress to date concerns cyclic $p$-groups with $p$ odd, for which a full classification and enumeration was obtained by Kov\'{a}cs and Nedela. In this paper we treat the remaining case $p = 2$, giving a complete classification and enumeration of skew morphisms of finite cyclic $2$-groups. Writing $\mathrm{Skew}(n)$ for the number of skew morphisms of $\mathbb{Z}_n$, we prove that $\mathrm{Skew}(2^e) = 4\,\mathrm{Skew}(2^{e-1}) - 4$ for each $e \geq 4$, and that $\mathrm{Skew}(2^e) = (7 \cdot 4^{e-2} + 8)/6$ for each $e \geq 3$. This completes the enumeration of skew morphisms for all cyclic $p$-groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin Bachratý. 2026-04-22. Enumeration of skew morphisms of cyclic $2$-groups. https://arxiv.org/abs/2604.20590

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