Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0512242

The true prosoluble completion of a group: examples and open problems

Goulnara Arzhantseva·Pierre de la Harpe·Delaram Kahrobaei
View original source ↗Read source document ↗Export metadata ↓

Abstract

The true prosoluble completion $P\Cal S (Γ)$ of a group $Γ$ is the inverse limit of the projective system of soluble quotients of $Γ$. Our purpose is to describe examples and to point out some natural open problems. We discuss a question of Grothendieck for profinite completions and its analogue for true prosoluble and true pronilpotent completions. 1. Introduction. 2. Completion with respect to a directed set of normal subgroups. 3. Universal property. 4. Examples of directed sets of normal subgroups. 5. True prosoluble completions. 6. Examples. 7. On the true prosoluble and the true pronilpotent analogues of Grothendieck's problem.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Goulnara Arzhantseva, Pierre de la Harpe, Delaram Kahrobaei. 2006-05-07. The true prosoluble completion of a group: examples and open problems. https://arxiv.org/abs/math/0512242

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↗