In 1977, Makanin established the decidability of equations in free monoids. A key ingredient in his proof is the exponent of periodicity: for a word $w$, it is the largest exponent $e$ such that $w$ contains a nonempty factor of the form $p^e$. Makanin showed the following for a system of equations in free monoids: if the system has a solution with a sufficiently large exponent of periodicity, then it has infinitely many solutions. However, the converse -- whether the existence of infinitely many solutions implies the existence of solutions with arbitrarily large exponent of periodicity -- remains open. In this paper, we investigate the analogous problem for quadratic equations in finitely generated groups. We use normal forms to define the exponent of periodicity. We then identify structural conditions on groups and their normal forms that guarantee that infinite solution sets of quadratic systems have an unbounded exponent of periodicity. We prove that these conditions are preserved under graph products and, in particular, hold for all finitely generated right-angled Artin groups. In addition, we show that they also hold for finitely generated (graph products of) torsion-free nilpotent and hyperbolic groups, and we characterize the Baumslag-Solitar groups satisfying them.
Given a group $G = H_1 \ast_A H_2$ which is the free product of two finitely generated groups $H_1$ and $H_2$ with amalgamation over a cyclic subgroup $A$ which is malnormal in $G$, we study relations between the structure of its subgroups and the structure of the group $G$ itself. Firstly, we show that if $H_1$ and $H_2$ are 3-free products of cyclics of rank $\ge 3$ then $G$ is also a 3-free product of cyclics. Secondly, we prove that if $H_1$ and $H_2$ are 4-free products of cyclics of rank $\ge 4$ then every 4-generated subgroup of $G$ is a free product of $\le 4$ cyclics or a 1-relator quotient of a free product of four cyclic groups. Here a group is called an $n$-free product of cyclics if every $n$-generated subgroup is a free product of $\le n$ cyclic groups. These results are based on ubiquitous applications of the Nielsen method for amalgamated free products which we recall carefully. Lastly, given an infinite, finitely presented group which is not free, but all of its infinite index subgroups are free, a well-known conjecture says that it is isomorphic to a surface group. We revisit and elaborate on predominantly group theoretic proofs of this conjecture for cyclically amalgamated products as above, as well as for certain HNN extensions.
Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that support addition and the operation $(x,y) \mapsto x \cdot 2^y$ on integers. They also posed the question of decidability of the Diophantine problem over the structure $\langle \mathbb{N}_{>0}; +, x \cdot 2^y, \leq, 1 \rangle$, which is closely related to power circuits. In this paper, we prove that the Diophantine problem over this structure is undecidable.