SearcharxivSearch

arXiv · 2604.01011

A residually finite analogue of Kegel's theorem on splitting automorphisms

Abstract

Thompson proved that every finite group admitting a fixed-point-free automorphism of prime order is nilpotent, and Kegel showed that the same conclusion holds for finite groups admitting a splitting automorphism of prime order. Motivated by these results, Sozutov asked whether a \(p'\)-group admitting a splitting automorphism of prime order is locally nilpotent if \[ \langle g, g^\varphi, \dots, g^{\varphi^{p-1}} \rangle \] is nilpotent for every \(g \in G\), \cite[Problem 10.59]{kourovka21}. We prove that if \(G\) is a periodic residually finite group admitting a splitting automorphism of prime order \(p\) then \(G\) is nilpotent of class bounded in terms of \(p\). This gives an affirmative answer, for residually finite groups, to the problem of Sozutov. We also prove that a possible counterexample to Sozutov's problem cannot be a Tarski monster.

Explore related subjects

Keep this discovery

BibTeXRIS

Alfonso Di Bartolo, Kıvanç Ersoy, Giovanni Falcone. 2026-04-01. A residually finite analogue of Kegel's theorem on splitting automorphisms. https://doi.org/10.1007/s00013-026-02278-3

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