SearcharxivSearch

arXiv · 2303.08623

Strong conciseness of coprime commutators in profinite groups

Abstract

Let $G$ be a profinite group. The coprime commutators $\gamma_j^*$ and $\delta_j^*$ are defined as follows. Every element of $G$ is both a $\gamma_1^*$-value and a $\delta_0^*$-value. For $j\geq 2$, let $X$ be the set of all elements of $G$ that are powers of $\gamma_{j-1}^*$-values. An element $a$ is a $\gamma_j^*$-value if there exist $x\in X$ and $g\in G$ such that $a=[x,g]$ and $(|x|,|g|)=1$. For $j\geq 1$, let $Y$ be the set of all elements of $G$ that are powers of $\delta_{j-1}^*$-values. The element $a$ is a $\delta_j^*$-value if there exist $x,y\in Y$ such that $a=[x,y]$ and $(|x|,|y|)=1$. In this paper we establish the following results. A profinite group $G$ is finite-by-pronilpotent if and only if there is $k$ such that the set of $\gamma_k^*$-values in $G$ has cardinality less than $2^{\aleph_0}$. A profinite group $G$ is finite-by-(prosoluble of Fitting height at most $k$) if and only if there is $k$ such that the set of $\delta_k^*$-values in $G$ has cardinality less than $2^{\aleph_0}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Iker de las Heras, Matteo Pintonello, Pavel Shumyatsky. 2023-03-15. Strong conciseness of coprime commutators in profinite groups. https://doi.org/10.1016/j.jalgebra.2023.06.003

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