Equations in a free 𝐐-group (Q4382952)

The authors give an algorithm that decides if a given finite system of equations in free groups with roots has a solution. Suppose \(A\) is an associative ring with 1. An \(A\)-group is a group \(G\) with an action \(G\times A\to G\); \((g,\alpha)\to g^\alpha\) satisfying \(g^1=g\), \(g^0=e\), \(e^\alpha=e\), \(g^{\alpha+\beta}=g^\alpha g^\beta\), \(g^{\alpha\beta}=(g^\alpha)^\beta\), \((h^{-1}gh)^\alpha=h^{-1}g^\alpha h\) and \(gh=hg\) implies \((gh)^\alpha=g^\alpha h^\alpha\). The class of all \(A\)-groups is a variety and for any group \(G\) there exists a universal \(A\)-group denoted by \(G^A\). For any set of primes \(\pi\) the set of rational numbers whose denominators are products of primes from \(\pi\) is a subring of the ring of rationals \(\mathbb{Q}\) and is denoted by \(\mathbb{Q}_\pi\). Theorem 1: Let \(\pi\) be a recursive set of primes. Then there is an algorithm that decides if a given finite system of equations over a free \(\mathbb{Q}_\pi\)-group has a solution, and in the case a solution exists, the algorithm finds a solution. In particular, the Diophantine problem over the groups \(F^\mathbb{Q}\), where \(F\) is a free group, is decidable. This theorem is also generalized to rings of characteristic \(0\). Theorem 2: For any field \(K\) of characteristic \(0\) and any free group \(F\), the Diophantine problem with coefficients in \(F\) over \(F^K\) is decidable. The proofs are quite technical and involve geometric properties of Cayley diagrams and reduction from free groups with roots to free groups.