Arithmetic sets in groups (Q2312833)

For a finitely generated group \(G\) and a proper subset \(K\) of \(G\), a system \(A(K)\) of equations is associated to \(K\). The authors define the notions of arithmetic sets depending on properties of the solutions of the system \(A(K)\). The set \(K\) is said to be \(b\)-arithmetic in \(G\) if \(A(K)\) has a non-trivial bounded solution in \(\mathbb C\). \(K\) is said to be \(p\)-arithmetic in \(G\) if \(A(K)\) has a non-trivial periodic solution in \(\mathbb C\). The set \(K\) is said to be totally \(d\)-arithmetic in \(G\) (respectively, totally \(p\)-arithmetic in \(G\)) if all solutions of \(A(K)\) are bounded (respectively, periodic). Properties of the defined arithmetic sets are studied in the cases of abelian groups and non-abelian free groups. For a countable group \(\Gamma\), a finite set \(K \subseteq \Gamma\) is called a right tile if there exists a subset \(C \subseteq \Gamma\) such that \(\Gamma\) is the disjoint union of \(gK\) where \(g\) is from \(C\). The notion of an arithmetic subset is closely related to the notion of a tile. In particular, some properties of arithmeticity are related to Coven-Meyerowitz conjecture [\textit{E. M. Coven} and \textit{A. Meyerowitz}, J. Algebra 212, No. 1, 161--174 (1999; Zbl 0927.11008)].