SearcharxivSearch

arXiv · 2510.03754

Coprime commutators in profinite groups

Abstract

By a coprime commutator in a profinite group $G$ we mean any element of the form $[x, y]$, where $x,y\in G$ and $(|x|,|y|)=1$. It is well-known that the subgroup generated by the coprime commutators of $G$ is precisely the pronilpotent residual $\gamma_\infty(G)$. There are several recent works showing that finiteness conditions on the set of coprime commutators have strong impact on the properties of $\gamma_\infty(G)$ and, more generally, on the structure of $G$. In this paper we show that if the set of coprime commutators of a profinite group $G$ is covered by countably many procyclic subgroups, then $\gamma_\infty(G)$ is finite-by-procyclic. In particular, it follows that $G$ is finite-by-pronilpotent-by-abelian.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristina Acciarri, Pavel Shumyatsky. 2025-10-04. Coprime commutators in profinite groups. https://arxiv.org/abs/2510.03754

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