Algorithmic problems for free-abelian times free groups
- Jordi Delgado and Enric Ventura
- 11 ene 2019
- 1 Min. de lectura
We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of ℤᵐ × 𝔽ₙ. These tools are used to solve several algorithmic problems for this family of groups: the membership problem, the isomorphism problem, the finite index problem, the subgroup and coset intersection problems, the fixed point problem, and the Whitehead problem.
See the full article here.
Entradas recientes
Ver todoIn this paper we delve into the behavior of multiple intersections of subgroups of free and free times free-abelian (FTA) groups with...
En aquest article revisem algunes de les propietats fonamentals del gruplliure i fem una exposició detallada de la teoria dels autòmats...
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the...