SearcharxivSearch

arXiv · 1301.5533

Localization, metabelian groups, and the isomorphism problem

Abstract

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We prove that this is an equivalence relation. It is a much coarser relation than isomorphism, our ultimate concern. It turns out that many of the groups in a given equivalence class share various properties including finite presentability. There are examples, such as the lamplighter group, where an equivalence class consists of a single isomorphism class and others where this is not the case. We give several examples where we solve the Isomorphism Problem. We prove also that the sequence of torsion-free ranks of the lower central quotients of a finitely generated metabelian group is computable. In a future paper we plan on proving that there is an algorithm to compute the numerator and denominator of the rational Poincar\'e series of a finitely generated metabelian group and will carry out this computation in a number of examples, which may shed a tiny bit of light on the Isomorphism Problem. Our proofs use localization, class field theory and some constructive commutative algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

Gilbert Baumslag, Roman Mikhailov, Kent Orr. 2013-01-23. Localization, metabelian groups, and the isomorphism problem. https://arxiv.org/abs/1301.5533

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