SearcharxivSearch

arXiv · 2504.10377

Groups with finitely many long commutators of maximal order

Abstract

Given a group $G$ and elements $x_1,x_2,\dots, x_\ell\in G$, the commutator of the form $[x_1,x_2,\dots, x_\ell]$ is called a commutator of length $\ell$. The present paper deals with groups having only finitely many commutators of length $\ell$ of maximal order. We establish the following results. Let $G$ be a residually finite group with finitely many commutators of length $\ell$ of maximal order. Then $G$ contains a subgroup $M$ of finite index such that $\gamma_\ell(M)=1$. Moreover, if $G$ is finitely generated, then $\gamma_\ell(G)$ is finite. Let $\ell,m,n,r$ be positive integers and $G$ an $r$-generator group with at most $m$ commutators of length $\ell$ of maximal order $n$. Suppose that either $n$ is a prime power, or $n=p^{\alpha}q^{\beta}$, where $p$ and $q$ are odd primes, or $G$ is nilpotent. Then $\gamma_\ell(G)$ is finite of $(m,\ell,r)$-bounded order and there is a subgroup $M\le G$ of $(m,\ell,r)$-bounded index such that $\gamma_\ell(M)=1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Iker de las Heras, Federico Di Concilio, Pavel Shumyatsky. 2025-04-14. Groups with finitely many long commutators of maximal order. https://arxiv.org/abs/2504.10377

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