SearcharxivSearch

arXiv · 2101.03404

Profinite groups with an automorphism of prime order whose fixed points have finite Engel sinks

Abstract

A right Engel sink of an element $g$ of a group $G$ is a set ${\mathscr R}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[g,x],x],\dots ,x]$ belong to ${\mathscr R}(g)$. (Thus, $g$ is a right Engel element precisely when we can choose ${\mathscr R}(g)=\{ 1\}$.) We prove that if a profinite group $G$ admits a coprime automorphism $\varphi $ of prime order such that every fixed point of $\varphi $ has a finite right Engel sink, then $G$ has an open locally nilpotent subgroup. A left Engel sink of an element $g$ of a group $G$ is a set ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$. (Thus, $g$ is a left Engel element precisely when we can choose ${\mathscr E}(g)=\{ 1\}$.) We prove that if a profinite group $G$ admits a coprime automorphism $\varphi $ of prime order such that every fixed point of $\varphi $ has a finite left Engel sink, then $G$ has an open pronilpotent-by-nilpotent subgroup.

Explore related subjects

Keep this discovery

BibTeXRIS

E. I. Khukhro, P. Shumyatsky. 2021-01-09. Profinite groups with an automorphism of prime order whose fixed points have finite Engel sinks. https://arxiv.org/abs/2101.03404

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