Algorithmic problems for free-Abelian times free groups. (Q2438024): Difference between revisions

Let \(\{G_{m,n}=\mathbb Z^m\times F_n:m,n\in\mathbb N\}\) be the class of direct products of free Abelian of finite rank groups by free of finite rank groups. An explicit expression for an arbitrary endomorphism of \(G_{m,n}\) is given. Some other preliminary results are obtained. These tools are used to solve several algorithmic problems for \(\mathbb Z\times F_n\): the membership problem, the isomorphism problem, the finite index problem (given a finite list of elements, decide whether the subgroup generated by these elements has finite index and, if so, find a set of coset representatives for it), the subgroup and coset intersection problems (given a pair of finitely generated subgroups (resp. a pair of cosets), decide whether the intersection of them (or a pair of given cosets) is finitely generated or not (is trivial or not) and, if so, compute a generating set (and in the negative case compute a representative)), the fixed point problem (given an automorphism (resp. endomorphism), decide whether the subgroup of fixed points is finitely generated or not and, if so, compute a generating set), and the Whitehead problem (given two elements, decide whether there exists an automorphism (resp. monomorphism, endomorphism) mapping the first of the elements to the second one).