Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Algorithmic problems for free-abelian times free groups

Autor
Delgado, J.; Ventura, E.
Tipus d'activitat
Article en revista
Revista
Journal of algebra
Data de publicació
2013-10-01
Volum
391
Pàgina inicial
256
Pàgina final
283
DOI
https://doi.org/10.1016/j.jalgebra.2013.04.033 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/20243 Obrir en finestra nova
https://arxiv.org/abs/1301.2355 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0021869313002548 Obrir en finestra nova
Resum
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 Zm×Fn. These tools are used to solve several algorithmic problems for Zm×Fn: the membership problem, the isomorphism problem, the finite index problem, the subgroup and coset intersection problems, the fixed point problem, and the Whitehead problem.
Citació
Delgado, J.; Ventura, E. Algorithmic problems for free-abelian times free groups. "Journal of algebra", 01 Octubre 2013, vol. 391, p. 256-283.
Paraules clau
Automorphism, Decision problem, Free group, Free-abelian group
Grup de recerca
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

Arxius