Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.04859

On profinite groups with commutators covered by countably many cosets

Eloisa Detomi·Marta Morigi·Pavel Shumyatsky
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G) depends on the properties of the subgroups. We prove the following theorem. Let C be a class of groups closed under taking subgroups, quotients, and such that in any group the product of finitely many normal C-subgroups is again a C-subgroup. If w is a multilinear commutator and G is a profinite group such that the set of all w-values is contained in a union of countably many cosets g_iG_i where each G_i is in C, then the verbal subgroup w(G) is virtually-C. This strengthens several known results.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Eloisa Detomi, Marta Morigi, Pavel Shumyatsky. 2017-11-13. On profinite groups with commutators covered by countably many cosets. https://arxiv.org/abs/1711.04859

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗