On positive and constructive groups (Q1937754): Difference between revisions

Fix a countable group \(G\) and an enumeration \(f\), that is, a surjective map \(f : \omega \to G\). The group \(G\), or more accurately the pair \((G, f)\) is said to be constructive if the set \(\{(m, n, k) \in \omega^3 : f(m)\cdot f(n) = f(k)\}\) is computable; the group is positive if this set is only computably enumerable. The article deals with the following problem. Given a fixed constructive (resp. positive) group \((G, f)\) and a computably enumerable normal subgroup \(H \leq G\), is there \textit{another} constructive (resp. positive) enumeration \(f'\) of \(G\) such that \(H\) is computable and some set of representatives for \(G/H\) is computably enumerable? The article provides some positive answers in specific cases; it is in particular required that \(G\) has unique roots (the maps \(g\mapsto g^n\) are all injective), and that \(G/H\) is torsion-free abelian. Analogous results have been obtained in the nilpotent case by the same author [Sib. Mat. Zh. 50, No. 1, 222--230 (2009); translation in Sib. Math. J. 50, No. 1, 181--187 (2009; Zbl 1212.20065)].