SearcharxivSearch

arXiv · 2501.01360

Groups with a covering condition on commutators

Abstract

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq k and all commutators of G are contained in the product SB_n. The importance of groups satisfying this condition was revealed in the recent study of probabilistically nilpotent finite groups of class two. The main result obtained in this paper is the following theorem. Let G be a group satisfying the (k,n)-covering condition for commutators. Then G' contains a characteristic subgroup B such that [G':B] and |B'| are both (k,n)-bounded. This extends several earlier results of similar flavour.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eloisa Detomi, Marta Morigi, Pavel Shumyatsky. 2025-01-02. Groups with a covering condition on commutators. https://arxiv.org/abs/2501.01360

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