SearcharxivSearch

arXiv · 0710.2108

On the isomorphism problem for generalized Baumslag-Solitar groups

Abstract

Generalized Baumslag-Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses the problem of determining whether two given labeled graphs define isomorphic groups; this is the isomorphism problem for GBS groups. There are two main results and some applications. First, we find necessary and sufficient conditions for a GBS group to be represented by only finitely many reduced labeled graphs. These conditions can be checked effectively from any labeled graph. Then we show that the isomorphism problem is solvable for GBS groups whose labeled graphs have first Betti number at most one.

Explore related subjects

Keep this discovery

BibTeXRIS

Matt Clay, Max Forester. 2007-10-10. On the isomorphism problem for generalized Baumslag-Solitar groups. https://doi.org/10.2140/agt.2008.8.2289

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