On the Diophantine problem in some one-relator groups
Carl-Fredrik Nyberg-Brodda

TL;DR
This paper investigates the decidability of the Diophantine problem in various one-relator groups, using algebraic methods to classify groups where equations can be algorithmically solved, including hyperbolic and torus knot groups.
Contribution
It introduces new classes of groups related to one-relator groups, proves decidability results for specific cases, and connects the problem to right-angled Artin groups and hyperbolic groups.
Findings
Decidability of the Diophantine problem in certain one-relator groups.
Undecidability of the submonoid membership problem in G_{2,2}.
All Newman groups NG(p,q) are hyperbolic and have decidable Diophantine problems.
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 is virtually a direct product of hyperbolic groups for all , 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 with defining relation a commutator…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Algebraic Geometry and Number Theory · Mathematical Dynamics and Fractals
