SearcharxivSearch

arXiv · 2208.07145

On the Diophantine problem in some one-relator groups

Abstract

We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the Reidemeister--Schreier method, together with general recent results by Dahmani & Guirardel and Ciobanu, Holt & Rees on the decidability of the Diophantine problem in general classes of groups. First, we give a sample of the methods of the article by proving that the one-relator group with defining relation $a^mb^n = 1$ is virtually a direct product of hyperbolic groups for all $m, n \geq 0$, and thus conclude decidability of the Diophantine problem in such groups. As a corollary, we obtain that the Diophantine problem is decidable in any torus knot group. Second, we study the two-generator, one-relator groups $G_{m,n}$ with defining relation a commutator $[a^m, b^n] = 1$, where $m, n \geq 1$. In doing so, we define and study a natural class of groups (RABSAGs), related to right-angled Artin groups (RAAGs). We reduce the Diophantine problem in the groups $G_{m,n}$ to the Diophantine problem in groups which are virtually certain RABSAGs. As a corollary of our methods, we show that the submonoid membership problem is undecidable in the group $G_{2,2}$ with the single defining relation $[a^2, b^2] = 1$. We use the recent classification by Gray & Howie of RAAG subgroups of one-relator groups to classify the RAAG subgroups of some RABSAGs, showing the potential usefulness of one-relator theory to this area. Finally, we define and study Newman groups $\operatorname{NG}(p,q)$, which are $(p+1)$-generated one-relator groups generalising the solvable Baumslag--Solitar groups. We show that all such groups are hyperbolic, and thereby also conclude decidability of their Diophantine problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Carl-Fredrik Nyberg-Brodda. 2022-08-15. On the Diophantine problem in some one-relator groups. https://arxiv.org/abs/2208.07145

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