SearcharxivSearch

arXiv · 2103.04061

Strong conciseness of coprime and anti-coprime commutators

Abstract

A coprime commutator in a profinite group $G$ is an element of the form $[x,y]$, where $x$ and $y$ have coprime order and an anti-coprime commutator is a commutator $[x,y]$ such that the orders of $x$ and $y$ are divisible by the same primes. In the present paper we establish that a profinite group $G$ is finite-by-pronilpotent if the cardinality of the set of coprime commutators in $G$ is less than $2^{\aleph_0}$. Moreover, a profinite group $G$ has finite commutator subgroup $G'$ if the cardinality of the set of anti-coprime commutators in $G$ is less than $2^{\aleph_0}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Eloisa Detomi, Marta Morigi, Pavel Shumyatsky. 2021-03-06. Strong conciseness of coprime and anti-coprime commutators. https://arxiv.org/abs/2103.04061

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