SearcharxivSearch

arXiv · 2212.09665

Commutators, centralizers, and strong conciseness in profinite groups

Abstract

A group $G$ is said to have restricted centralizers if for each $g \in G$ the centralizer $C_G(g)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. We take interest in profinite groups with restricted centralizers of uniform commutators, that is, elements of the form $[x_1,\dots,x_k]$, where $\pi(x_1)=\pi(x_2)=\dots=\pi(x_k)$. Here $\pi(x)$ denotes the set of prime divisors of the order of $x\in G$. It is shown that such a group necessarily has an open nilpotent subgroup. We use this result to deduce that $\gamma_k(G)$ is finite if and only if the cardinality of the set of uniform $k$-step commutators in $G$ is less than $2^{\aleph_0}$

Explore related subjects

Keep this discovery

BibTeXRIS

Eloisa Detomi, Marta Morigi, Pavel Shumyatsky. 2022-12-19. Commutators, centralizers, and strong conciseness in profinite groups. https://arxiv.org/abs/2212.09665

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