SearcharxivSearch

arXiv · 2507.16482

On the isomorphism problem for cyclic JSJ decompositions: vertex elimination

Abstract

We introduce two new moves on graphs of groups with cyclic edge groups that preserve the fundamental group. These moves allow us to address the isomorphism problem without the use of expansions, therefore keeping the number of vertices and edges constant along sequences of moves witnessing an isomorphism between two groups. We further show that the isomorphism problem for a large family of cyclic JSJ decompositions reduces to the case of generalized Baumslag-Solitar groups (GBS), and that among GBSs, it suffices to consider one-vertex graphs. As an application of the methods, we solve the isomorphism problem for a broad class of flexible GBSs. Finally, we discuss potential further applications of our techniques.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dario Ascari, Montserrat Casals-Ruiz, Ilya Kazachkov. 2025-07-22. On the isomorphism problem for cyclic JSJ decompositions: vertex elimination. https://arxiv.org/abs/2507.16482

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