SearcharxivSearch

arXiv · 1211.0493

Nilpotent completions of groups, Grothendieck pairs, and four problems of Baumslag

Abstract

Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually torsion-free-nilpotent groups of the same nilpotent genus such that one is finitely presented and the other is not. (ii) There exists a pair of finitely presented, residually torsion-free-nilpotent groups of the same nilpotent genus such that one has a solvable conjugacy problem and the other does not. (iii) There exists a pair of finitely generated, residually torsion-free-nilpotent groups of the same nilpotent genus such that one has finitely generated second homology $H_2(-,\Z)$ and the other does not. (iv) A non-trivial normal subgroup of infinite index in a finitely generated parafree group cannot be finitely generated. In proving this last result, we establish that the first $L^2$ betti number of a finitely generated parafree group of rank $r$ is $r-1$. It follows that the reduced $C^*$-algebra of the group is simple if $r\ge 2$, and that a version of the Freiheitssatz holds for parafree groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin R. Bridson, Alan W. Reid. 2015-01-07. Nilpotent completions of groups, Grothendieck pairs, and four problems of Baumslag. https://doi.org/10.1093/imrn%2Frnt353

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