Algorithmic problems for free-abelian times free groups

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/20243

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor	Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.contributor.author	Delgado Rodríguez, Jordi
dc.contributor.author	Ventura Capell, Enric
dc.date	2013-10-01
dc.identifier.citation	Delgado, J.; Ventura, E. Algorithmic problems for free-abelian times free groups. "Journal of algebra", 01 Octubre 2013, vol. 391, p. 256-283.
dc.identifier.citation	0021-8693
dc.identifier.citation	10.1016/j.jalgebra.2013.04.033
dc.identifier.uri	http://hdl.handle.net/2117/20243
dc.language.iso	eng
dc.relation	http://www.sciencedirect.com/science/article/pii/S0021869313002548
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra
dc.subject	Group theory
dc.subject	Free groups
dc.subject	Abelian groups
dc.subject	Automorphisms
dc.subject	Automorphism
dc.subject	Decision problem
dc.subject	Free group
dc.subject	Free-abelian group
dc.subject	Grups, Teoria de
dc.subject	Grups abelians
dc.subject	Automorfismes
dc.subject	20E05
dc.subject	20k01
dc.title	Algorithmic problems for free-abelian times free groups
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author