betaFeedback

WorksMathematics

The Diophantine Problem with constraints in some free-by-cyclic groups

Abstract

In this paper we explore the Diophantine Problem, that is, the solvability of equations, in one-relator and free-by-cyclic groups, showing that this is decidable in some cases and undecidable otherwise, depending on their abelianisation and centre. In particular, we focus on a version of the Diophantine Problem which asks about the existence of solutions satisfying abelianisation constraints, and prove a number of results concerning the decidability of this problem for free-by-cyclic groups with centre, tree-GBS groups, cyclically pinched groups and the first hydra group.

Introduction

The question of decidability of (systems of) equations in groups is widely known as the Diophantine Problem for groups, and we denote it by DP\mathcal{DP}, or by DP(G)\mathcal{DP}(G) when it refers to a group GG. We extend the DP\mathcal{DP} by requiring that the solution sets satisfy certain constraints, and study this augmented problem in one-relator groups and more generally, free-by-cyclic groups. We give the most general statements if the groups have non-trivial centre, but we also obtain results for several groups with trivial centre.

Among several types of constraints (see § 4.1), we focus on abelian predicates, which we also call abelianisation constraints, and denote by ab\mathrm{ab}. These constraints require that the ‘abelian form’ of the solutions, where any two symbols commute, satisfies a given set of equations as well; equivalently, the constraints can be viewed as equations in the abelianisation of GG. This problem, denoted by DP(G,ab)\mathcal{DP}(G,\mathrm{ab}) for a group GG, was introduced in [14], where it was shown to be undecidable in hyperbolic groups and right-angled Artin groups, if these have sufficiently large abelianisation; that is, they have abelianisation with torsion-free rank greater than 2.

Studying the Diophantine Problem with abelianisation constraints can often give methods for studying the ‘plain’ Diophantine Problem. For example, if the commutator width in a group GG is finite, then the commutator subgroup in GG is definable in DP(G)\mathcal{DP}(G), and so DP(G)\mathcal{DP}(G) and DP(G,ab)\mathcal{DP}(G,\mathrm{ab}) are equivalent. This has been leveraged in Thompson’s group FF to prove undecidability of the Diophantine Problem [28], using the non-trivial fact that FF has finite commutator width [30]. In other cases, the commutator subgroup may not be definable in DP(G)\mathcal{DP}(G), but one can often use similar techniques to compare exponent sums of various elements, as has been successful when showing the Diophantine Problems in various groups are undecidable, including certain GBS groups [33], groups of the form F3×F2F_3 \times F_2 [33] and one-relator groups [32]. An important open question in the area is also whether the Diophantine Problem is decidable in the Grigorchuk group G\mathcal{G} and related branch groups. Since G\mathcal{G} has finite commutator width [4], DP(G,ab)=DP(G)\mathcal{DP}(\mathcal{G},\mathrm{ab})=\mathcal{DP}(\mathcal{G}), and so understanding the Diophantine Problem with abelianisation constraints would settle this open question.

When free-by-cyclic groups have non-trivial centre, the fact that the Diophantine Problem is decidable follows from [15] (see Theorem 1.1). The main goal of the paper is to show that a stronger result holds in these groups when their abelianisation is virtually Z\mathbb{Z}: the Diophantine Problem with abelianisation constraints is decidable.

2020 Mathematics Subject Classification. 20F10, 20F65, 68Q45.

Key words and phrases. equations in groups, one-relator groups, free-by-cyclic groups, decidability.

We use several characterisations of one-relator groups with centre and the related classes of groups described below. In particular, we will use the fact that all groups of type (ii) - (v) contain (i) (see § 4.4 for a justification of the implications):

  • (i) infinite one-relator groups with non-trivial centre (O);

  • (ii) generalised Baumslag-Solitar (GBS) groups with non-trivial centre (GBS);

  • (iii) [finitely generated free]-by-cyclic groups with non-trivial centre (FbC);

  • (iv) free-by-cyclic groups of the form F⋊φZF \rtimes_{\varphi} \mathbb{Z} for some finitely generated free group FF and some automorphism φ∈Aut⁡(F)\varphi\in\operatorname{Aut}(F) that has finite order in Out⁡(F)\operatorname{Out}(F) (FbZf);

  • (v) virtually F×ZF \times\mathbb{Z} for some finitely generated free group FF (vFZ).

(i)⇒[5](ii)⇔[38](iii)⇔[38](iv)⇒Lemma 2.7(v)(i) \xRightarrow{[5]} (ii) \xLeftrightarrow{[38]} (iii) \xLeftrightarrow{[38]} (iv) \xRightarrow{\textit{Lemma 2.7}} (v)

The main result of [15], which states that the Diophantine Problem is decidable in all groups that are virtually direct products of hyperbolic groups, implies the following.

Theorem 1.1. The Diophantine Problem is decidable in (v), and therefore in (i) - (iv).

Furthermore, the groups we are interested in (one-relator with centre, free-by-cyclic, GBS) are finite-index subgroups of direct products of specific hyperbolic groups (see Prop. 3.2), in the spirit of [15], and the Diophantine Problem is well understood in these direct products. Thus we can reduce the Diophantine Problem (with or without constraints) in free-by-cyclic and one-relator groups with centre to the problem of solving equations in direct products of hyperbolic groups with recognisable (plus some additional) constraints. Moreover, when DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable, we can describe the solutions sets to systems of equations in terms of formal languages, as EDT0L languages. This is a class of languages that describes the solutions in many classes of groups, in particular hyperbolic [12] and abelian, which are relevant here (see [16] for an overview).

Our first main result is:

Theorem 1.2. Let GG be a [finitely-generated free]-by-cyclic group with centre and virtually cyclic abelianisation. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable and EDT0L.

This immediately implies:

Corollary 1.3. Let GG be a one-relator group with centre and virtually cyclic abelianisation. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable and EDT0L.

The class of groups in the statement of Theorem 1.2 are in fact exactly the tree-GBS groups, that is, the generalised Baumslag-Solitar groups whose defining graph (as a graph of groups) is a tree. Thus we have

Corollary 1.4. Let GG be a tree-GBS group. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable and EDT0L.

In contrast in recent work it has been shown that there are GBS-groups with undecidable Diophantine Problem; see [33]. Using this connection we shall see that Theorem 1.2 may also be applied to the more general class of tree-products of infinite cyclic groups (i.e. a graph product where all vertex groups are Z\mathbb{Z} and the defining graph is a tree) to show the following.

Theorem 1.5. Let GG be a tree product of infinite cyclic groups. Then GG has decidable Diophantine Problem with EDT0L solutions. Furthermore:

  1. if all edge groups are infinite cyclic then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable and EDT0L;

  2. otherwise, DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is undecidable.

When the torsion-free rank of the abelianisation is ≥3\ge3, we obtain undecidability results.

Theorem 1.6. Let GG be a [finitely generated free]-by-cyclic group with non-trivial centre and a torsion-free rank 3 or greater abelianisation. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is undecidable.

We note that while we do utilise finite index subgroups and extensions in our reasoning in this paper, in general it is unknown whether decidability of the Diophantine Problem is preserved under taking finite index subgroups or extensions. Also, DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is know not to be preserved when taking finite index subgroups. It is known that for every RAAG, there is a corresponding RACG that contains it as a subgroup of finite index. Now in [14] it is proved that (a) If GG is a right-angled Artin group that is not abelian then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is undecidable, and also that (b) If HH is a right-angled Coxeter group then DP(H,ab)\mathit{DP}(H,\mathrm{ab}) is decidable. Hence if we take any non abelian RAAG GG it has a finite index extension HH with G≤HG \leq H of finite index (the RACG described above) such that DP(H,ab)\mathit{DP}(H,\mathrm{ab}) is decidable but DP(G,ab)\mathit{DP}(G,\mathrm{ab}) has undecidable with GG a finite index subgroup of HH.

For groups with trivial centre we have the following results.

Theorem 1.7. Let G=⟨a,b,t∣tat−1=ab,tbt−1=b⟩G = \langle a,b,t \mid tat^{-1} = ab, tbt^{-1} = b\rangle be the ‘first hydra group’. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is undecidable.

We note that whether the first hydra group (or any other hydra group) has a decidable Diophantine Problem is an open problem.

Recall that a cyclically pinched group GG is a free product of two finite rank free groups amalgamated over an infinite cyclic group; that is,

G=F(a1,…,an)∗ZF(b1,…,bm),G = F(a_{1},\ldots,a_{n}) *_{\mathbb{Z}} F(b_{1},\ldots,b_{m}),

and the amalgamation is of the form ⟨U⟩=⟨V⟩≅Z\langle U\rangle= \langle V\rangle\cong\mathbb{Z}, where U∈F(a1,…,an)U \in F(a_{1},\ldots,a_{n}) and V∈F(b1,…,bm)V \in F(b_{1},\ldots,b_{m}) are non-trivial. By noticing that these groups are relatively hyperbolic with sufficiently well-behaved parabolics, we are able to apply existing combination results to obtain the following:

Corollary 1.8. The existential theory (and hence the Diophantine Problem) is decidable in all cyclically pinched groups.

Cyclically pinched groups provide a rare example of a class of groups where the decidability of the Diophantine Problem with abelianisation constraints can be fully classified, without a ‘gap’ corresponding to a specific abelianisation. In this case, those with virtually cyclic abelianisation are amongst the decidable examples.

Theorem 1.9. Let GG be a cyclically pinched group. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable if and only if GG has exactly two generators. In the case that GG has two generators, DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is EDT0L.

In [14] it is shown that for a hyperbolic group GG if the abelianisation of GG has torsion-free rank ≥2\geq2 DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is undecidable, while if the abelianisation of GG is finite then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable. This motivates the study of DP(G,ab)\mathit{DP}(G,\mathrm{ab}) for hyperbolic groups (and finitely generated groups more generally) with torsion-free rank 11. As explained in [14] the decidability of DP(G,ab)\mathit{DP}(G,\mathrm{ab}) when GG has decidable Diophantine Problem and its abelianisation has torsion-free rank 11 remains an open problem. Motivated by this in Problem 4 in [14] it is asked whether the braid group on three strands ⟨a,b∣aba=bab⟩\langle a,b \mid aba=bab\rangle (or more generally, odd dihedral Artin groups) have decidable DP(G,ab)\mathit{DP}(G,\mathrm{ab}). Observing that every odd dihedral Artin groups are isomorphic to a torus knot group of the form ⟨x,y∣x2=ym⟩\langle x,y \mid x^{2}=y^{m}\rangle (see for example [17 Lemma 2.8]) we may apply the results in this paper to give a positive answer to that question:

Corollary 1.10. Let Tp,q=⟨a,b∣ap=bq⟩T_{p,q} = \langle a,b \mid a^{p}=b^{q}\rangle with p,q≥2p,q \geq2. Then DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable. In particular DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable in every torus-knot group and DP(G,ab)\mathit{DP}(G,\mathrm{ab}) is decidable in every odd dihedral Artin group.

The main tool used to prove undecidability results in this paper is interpretability using systems of equations, which allows us to translate one structure into another and to reduce the Diophantine Problem from one structure to the other. The main reductions are to the Diophantine Problem in the ring of integers, which is a classical undecidable problem (Hilbert’s 10th problem).

Connections to computer science.

The Diophantine Problem with abelianisation constraints in groups is inspired by work in theoretical computer science, where the study of equations with language theoretic, length and abelianisation constraints in free monoids has a long tradition and is a very active field of research [1, 9, 21, 27, 31].

Deciding whether a free monoid equation has solutions satisfying linear length constraints is a major open question, of both theoretical importance (if undecidable, it would provide a new solution to Hilbert’s 10th problem for Diophantine polynomials) and practical implications, in the context of string/SMT solvers for security analysis, formal verification, the robustness of Web applications, and more [2]. SMT solvers, which have boomed over the last 10 years, consider first-order formulae in a wide context, such as the real numbers, integers, data structures, and strings over finite alphabets. The question is then whether there is a solution for a first-order formula that is significantly more complex than what is handled by SAT-solvers: the name ‘satisfiability modulo theories’ (SMT) expresses the fact that the solvers work ‘modulo’ a certain theory (beyond the Boolean framework) in first-order logic with equality. In algebraic terms, this means solving equations in free monoids and related structures (as many of the constraints lead naturally to commutativity or other relations between the alphabet letters), as every string can be seen as an element over the generators of a finitely generated monoid or group.

Declaration of (no) AI usage

No AI tools were used for proving any results, making any conjectures or generating any examples.

No AI tools were used for any aspects of the writing or editing of this paper.

Acknowledgements

The first author benefited from the support provided by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, EXC-2046/2, project ID: 390685689).

The research of the second and third-named authors was supported by the EPSRC Fellowship grant EP/V032003/1 ‘Algorithmic, topological and geometric aspects of infinite groups, monoids and inverse semigroups’.

Preliminaries

Let x={X1,…,Xm}\mathbf{x} = \{X_1,\ldots,X_m\} be a set of variables, where m≥1m \ge1. For a group GG, a finite system of equations in GG over the variables x\mathbf{x} is a finite subset EE of the free product G∗F(x)G * F(\mathbf{x}), where F(x)F(\mathbf{x}) is the free group on x\mathbf{x}. If E={w1,…,wn}E = \{w_1,\ldots,w_n\}, then a solution to the system (w1=1)∧⋯∧(wn=1)(w_1 = 1) \wedge\cdots\wedge(w_n = 1) is a homomorphism ϕ:G∗F(x)→G\phi: G * F(\mathbf{x}) \to G, such that ϕ(w1)=⋯=ϕ(wn)=1G\phi(w_1) = \cdots= \phi(w_n) = 1_G and ϕ(g)=g\phi(g) = g for all g∈Gg \in G. If EE has a solution, then it is satisfiable.

For a group GG, we say that systems of equations over GG are decidable over GG if there is an algorithm to determine whether any given system is satisfiable. The question of decidability of systems of equations in GG is called the Diophantine Problem for GG, and denoted DP(G)DP(G).

The Diophantine Problem with constraints

We can augment the Diophantine Problem for a group by requiring that the solutions belong to certain sets, which we call constraints (see [14] and [13] for more background). We start by defining formal language constraints.

Let Σ\Sigma be a finite alphabet and let S=Σ±1S = \Sigma^{\pm1}. Suppose GG is a group generated by SS, and let π:S∗→G\pi: S^* \to G be the natural projection from the free monoid S∗S^* generated by SS to GG, taking a word over the generators to the element it represents in the group. A language is regular if it is recognised by a finite state automaton, as is standard.

Definition 2.1.

(1) A subset LL of GG is recognisable if the full preimage π−1(L)\pi^{-1}(L) is a regular subset of S∗S^*.

(2) A subset LL of GG is rational if LL is the image π(R)\pi(R) of a regular subset RR of S∗S^*.

It follows immediately from the definition that recognisable subsets of GG are rational.

Let E\mathcal{E} be a system of equations on variables x={X1,…,Xk}\mathbf{x} = \{X_1,\ldots,X_k\} in a group GG. The Diophantine Problem with rational (resp. recognisable) constraints asks about the existence of solutions to E\mathcal{E}, with some of the variables restricted to taking values in finitely many specified rational (resp. recognisable) sets. We write DP(G,Rat⁡)\mathit{DP}(G,\operatorname{Rat}) and DP(G,Rec⁡)\mathit{DP}(G,\operatorname{Rec}) for the two cases.

While there are many non-rational constraints of interest (see [10]), we focus here on abelianisation constraints. For any group GG, let ab⁡:G→Gab\operatorname{ab}:G\to G^{\mathrm{ab}} be the natural abelianisation map to Gab=G/G′G^{\mathrm{ab}}=G/G', that is, the quotient of GG by its commutator subgroup. We write DP(G,ab⁡)\mathit{DP}(G,\operatorname{ab}) for the DP\mathit{DP} where an abelian predicate is added, or equivalently, abelianisation constraints are imposed. A set of abelianisation constraints is a system Θ\Theta of equations in the group GabG^{\mathrm{ab}}, and DP(G,ab⁡)\mathit{DP}(G,\operatorname{ab}) asks whether a solution to E\mathcal{E} exists such that the abelianisation of the solution satisfies the system Θ\Theta in GabG^{\mathrm{ab}}.

Example 2.2. Let F(A)F(A) be the free group of rank 22 with basis A={α,β}A=\{\alpha,\beta\} and abelianisation ab⁡:F(A)→Z2\operatorname{ab}:F(A)\to\mathbb{Z}^2. For the set of variables {X,Y,Z}\{X,Y,Z\} consider the equation

X2αY=YZ−2α.X^2\alpha Y=YZ^{-2}\alpha.

An instance of DP(G,ab)\mathit{DP}(G,\mathbf{ab}) would be to ask if there is a solution σ\sigma such that

ab(σ(X))+ab(σ(Z))=(0,0).\mathbf{ab}(\sigma(X))+\mathbf{ab}(\sigma(Z))=(0,0).

The answer is ‘yes’, as the triple (αβ,α,α−1β−1)(\alpha\beta,\alpha,\alpha^{-1}\beta^{-1}) shows: σ0(X)=αβ\sigma_0(X)=\alpha\beta, σ0(Y)=α\sigma_0(Y)=\alpha and σ0(Z)=(βα)−1\sigma_0(Z)=(\beta\alpha)^{-1} satisfies σ0(X2αY)=σ0(YZ−2α)\sigma_0(X^2\alpha Y)=\sigma_0(YZ^{-2}\alpha). Moreover, σ0\sigma_0 satisfies ab(σ0(X))=−ab(σ0(Z))=(1,1)\mathbf{ab}(\sigma_0(X))=-\mathbf{ab}(\sigma_0(Z))=(1,1), so the abelianisation constraint holds.

A key notion associated to a system of equations is that of a DP(G)\mathit{DP}(G)-definable set.

References

  1. [1]Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukáš Holík, Ahmed Rezine, Philipp Rümmer, and Jari Stenman, String constraints for verification, Computer aided verification, 2014, pp. 150–166.DOI
  2. [2]Roberto Amadini, A survey on string constraint solving, ACM Comput. Surv. 55 (2021), no. 1.arxiv.org/abs/2002.02376
  3. [3]Donald Anthony Barkauskas, Centralizers in fundamental groups of graphs of groups, Ph.D. Thesis, 2003.
  4. [4]Laurent Bartholdi, Thorsten Groth, and Igor Lysënok, Commutator width in the first Grigorchuk group, Groups Geom. Dyn. 16 (2022), no. 2, 493–522. MR4502614arxiv.org/abs/1710.05706
  5. [5]Gilbert Baumslag and Tekla Taylor, The centre of groups with one defining relator, Math. Ann. 175 (1968), 315–319. MR222144DOI
  6. [6]M. Bestvina and M. Feighn, A combination theorem for negatively curved groups, J. Differential Geom. 35 (1992), no. 1, 85–101. MR1152226DOI
  7. [7]Martin R. Bridson and Pawel Piwek, Profinite rigidity for free-by-cyclic groups with centre, J. Lond. Math. Soc. (2) 111 (2025), no. 6, Paper No. e70181, 28. MR4920376
  8. [8]Carl-Fredrik Nyberg Brodda, Undecidability of the Diophantine problem for one-relator groups and one-relation monoids, arXiv preprint arXiv:2608.01983 (2026).arxiv.org/abs/2608.01983
  9. [9]J. Richard Büchi and Steven Senger, Definability in the existential theory of concatenation and undecidable extensions of this theory, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34 (1988), no. 4, 337–342.
  10. [10]Laura Ciobanu, Word equations, constraints, and formal languages, Developments in language theory, [2024] ©2024, pp. 1–12. MR4786835arxiv.org/abs/2406.02160
  11. [11]Laura Ciobanu, Volker Diekert, and Murray Elder, Solution sets for equations over free groups are EDTOL languages, Internat. J. Algebra Comput. 26 (2016), no. 5, 843–886. MR3536438
  12. [12]Laura Ciobanu and Murray Elder, The complexity of solution sets to equations in hyperbolic groups, Israel J. Math. 245 (2021), no. 2, 869–920. MR4358266arxiv.org/abs/2001.09591
  13. [13]Laura Ciobanu, Alex Evett, and Alex Levine, Effective equation solving, constraints, and growth in virtually abelian groups, SIAM J. Appl. Algebra Geom. 9 (2025), no. 1, 235–260. MR4876546arxiv.org/abs/2309.00475
  14. [14]Laura Ciobanu and Albert Garreta, Group equations with abelian predicates, Int. Math. Res. Not. IMRN 5 (2024), 4119–4159. MR4714338arxiv.org/abs/2204.13946
  15. [15]Laura Ciobanu, Derek Holt, and Sarah Rees, Equations in groups that are virtually direct products, J. Algebra 545 (2020), 88–99. MR4044690
  16. [16]Laura Ciobanu and Alex Levine, Languages, groups, and equations, Languages and automata—GAGTA Book 3, [2024] ©2024, pp. 63–93. MR4978135arxiv.org/abs/2303.07825
  17. [17]Gemma Crowe, Twisted conjugacy in dihedral Artin groups I: torus knot groups, J. Groups Complex. Cryptol. 17 (2025), no. 1, Paper No. 3, 23. MR4919538
  18. [18]François Dahmani, Combination of convergence groups, Geom. Topol. 7 (2003), 933–963. MR2026551
  19. [19]________, Existential questions in (relatively) hyperbolic groups, Israel J. Math. 173 (2009), 91–124. MR2570661arxiv.org/abs/math/0505345
  20. [20]François Dahmani and Vincent Guirardel, Foliations for solving equations in groups: free, virtually free, and hyperbolic groups, J. Topol. 3 (2010), no. 2, 343–404. MR2651364
  21. [21]Joel D. Day, Vijay Ganesh, Paul Hé Florin Manea, and Dirk Nowotka, The satisfiability of word equations: Decidable and undecidable theories, International conference on reachability problems, 2018, pp. 15–29.DOI
  22. [22]Matthew B. Day and Richard D. Wade, Relative automorphism groups of right-angled Artin groups, J. Topol. 12 (2019), no. 3, 759–798. MR4072157DOI
  23. [23]Volker Diekert and Murray Elder, Solutions to twisted word equations and equations in virtually free groups, Internat. J. Algebra Comput. 30 (2020), no. 4, 731–819. MR4113851arxiv.org/abs/1701.03297
  24. [24]Will Dison and Timothy R. Riley, Hydra groups, Comment. Math. Helv. 88 (2013), no. 3, 507–540. MR3093501
  25. [25]Moon Duchin, Hao Liang, and Michael Shapiro, Equations in nilpotent groups, Proc. Amer. Math. Soc. 143 (2015), no. 11, 4723–4731. MR3391031
  26. [26]F. A. Dudkin, Generalized Baumslag-Solitar groups universally equivalent to tree groups, Algebra Logic 63 (2024), no. 4, 249–257. Translation of Algebra-Logika 63 (2024), no. 4, 377–389. MR4965350DOI
  27. [27]V. G. Durnev, Equations on free semigroups and groups, Mat. Zametki 16 (1974), 717–724. MR379160DOI
  28. [28]Luna Elliott and Alex Levine, The Diophantine problem in Thompson’s group F, Math. Comp. 95 (2026), no. 360, 2013–2023. MR5057685DOI
  29. [29]Alex Evett and Alex Levine, Equations in virtually abelian groups: languages and growth, Internat. J. Algebra Comput. 32 (2022), no. 3, 411–442. MR4417480arxiv.org/abs/2009.03968
  30. [30]Światosław R. Gal and Jakub Gismatullin, Uniform simplicity of groups with proximal action, Trans. Amer. Math. Soc. Ser. B 4 (2017), 110–130. With an appendix by Nir Lazarovich. MR3693109DOI
  31. [31]Albert Garreta and Robert Gray, On equations and first-order theory of one-relator monoids, Inform. and Comput. 281 (December 2021) (English).arxiv.org/abs/1908.00098
  32. [32]Robert D. Gray and Alex Levine, The Diophantine problem in the Baumslag-Gersten group, arXiv preprint arXiv:2607.24189 (2026).arxiv.org/abs/2607.24189
  33. [33]________, Undecidable Diophantine problems in generalisations of one-relator groups, arXiv preprint arXiv:2605.30535 (2026).arxiv.org/abs/2605.30535
  34. [34]Oli Jones and Alan Logan, Fixed subgroups of generalised Baumslag-Solitar groups, arXiv preprint arXiv:2510.12716 (2025).arxiv.org/abs/2510.12716
  35. [35]Alex Levine, EDTOL solutions to equations in group extensions, J. Algebra 619 (2023), 860–899. MR4534696
  36. [36]________, Quadratic Diophantine equations, the Heisenberg group and formal languages, Israel J. Math. 269 (2025), no. 1, 337–383. MR4982576arxiv.org/abs/2203.04849
  37. [37]Gilbert Levitt, On the automorphism group of generalized Baumslag-Solitar groups, Geom. Topol. 11 (2007), 473–515. MR2302496DOI
  38. [38]________, Generalized Baumslag-Solitar groups: rank and finite index subgroups, Ann. Inst. Fourier (Grenoble) 65 (2015), no. 2, 725–762. MR3449166arxiv.org/abs/1304.7582
  39. [39]Hao Liang, Equation problem over central extensions of hyperbolic groups, J. Topol. Anal. 6 (2014), no. 2, 167–192. MR3191648arxiv.org/abs/1307.5889
  40. [40]Alan D. Logan, The conjugacy problem for ascending HNN-extensions of free groups, Proc. Lond. Math. Soc. (3) 131 (2025), no. 4, Paper No. e70088, 24. MR4970629arxiv.org/abs/2209.04357
  41. [41]Markus Lohrey and Géraud Sénizergues, Theories of HNN-extensions and amalgamated products, Automata, languages and programming. Part II, 2006, pp. 504–515. MR2307261
  42. [42]Roger C. Lyndon and Paul E. Schupp, Combinatorial group theory, Classics in Mathematics, Springer-Verlag, Berlin, 2001. Reprint of the 1977 edition. MR1812024DOI
  43. [43]Ju.V. Matijasevic, The Diophantineness of enumerable sets, Dokl. Akad. Nauk SSSR 191 (1970), 279–282. MR258744
  44. [44]K. A. Mihailova, The occurrence problem for direct products of groups, Dokl. Akad. Nauk SSSR 119 (1958), 1103–1105. MR100018
  45. [45]Matthieu Picantin, Cyclic amalgams, HNN extensions, and Garside one-relator groups, J. Algebra 607 (2022), 437–465. MR4441337arxiv.org/abs/1306.5724
  46. [46]Alfred Pietrowski, The isomorphism problem for one-relator groups with non-trivial centre, Math. Z. 136 (1974), 95–106. MR349851DOI
  47. [47]Derek J. S. Robinson, The Schur multiplier of a generalized Baumslag-Solitar group, Rend. Semin. Mat. Univ. Padova 125 (2011), 207–215. MR2866127DOI
  48. [48]Vitaly A. Roman’kov, Diophantine questions in the class of finitely generated nilpotent groups, J. Group Theory 19 (2016), no. 3, 497–514. MR3510840DOI
  49. [49]Herman Servatius, Automorphisms of graph groups, J. Algebra 126 (1989), no. 1, 34–60. MR1023285DOI

Paper details

vlnc:W_zh6kdrgu
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

None listed by the authors

View statement
Looking for related papers…
Contents