SearcharxivSearch

arXiv · 0906.2439

When right n-Engel elements of a group form a subgroup?

Abstract

Let $R_n(G)$ denotes the set of all right $n$-Engel elements of a group $G$. We show that in any group $G$ whose 5th term of lower central series has no element of order 2, $R_3(G)$ is a subgroup. Furthermore we prove that $R_4(G)$ is a subgroup for locally nilpotent groups $G$ without elements of orders 2, 3 or 5; and in this case the normal closure $ ^G$ is nilpotent of class at most 7 for each $x\in R_4(G)$. Using a group constructed by Newman and Nickel we also show that, for each $n\geq 5$, there exists a nilpotent group of class $n+2$ containing a right $n$-Engel element $x$ and an element $a\in G$ such that both $[x^{-1},_n a]$ and $[x^{k},_n a]$ are of infinite order for all integers $k\geq 2$. We finish the paper by proving that at least one of the following happens: (1) There is an infinite finitely generated $k$-Engel group of exponent $n$ for some positive integer $k$ and some 2-power number $n$. (2) There is a group generated by finitely many bounded left Engel elements which is not an Engel group.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Abdollahi, H. Khosravi. 2009-06-13. When right n-Engel elements of a group form a subgroup?. https://arxiv.org/abs/0906.2439

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