SearcharxivSearch

arXiv · 2605.30535

Undecidable Diophantine problems in generalisations of one-relator groups

Abstract

Motivated by the open problem of whether all one-relator groups have decidable Diophantine problem, in this paper we prove a collection of undecidability results about the Diophantine problem for several families of groups that are close to one-relator groups in various ways. We prove that there is a generalised Baumslag--Solitar group with an undecidable Diophantine problem. Using our example we show there is a group with an undecidable Diophantine problem that is quasi-isometric to a one-relator group. Also, we prove that there is a one-relator product of cyclic groups with an undecidable Diophantine problem. In addition, we show that there there is a one-relator group $G$, with a single fixed finite rank free subgroup $H$, such that the Diophantine problem for $G$ with $H$-constraints is undecidable. The related open question of whether there is a free-by-cyclic group with undecidable Diophantine problem is also discussed, and we prove that there is a free-by-free group of the form $F_3 \rtimes F_2$ with an undecidable Diophantine problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert D. Gray, Alex Levine. 2026-05-28. Undecidable Diophantine problems in generalisations of one-relator groups. https://arxiv.org/abs/2605.30535

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