Algorithmic recognition of infinite cyclic extensions

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/96690

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor	Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.contributor.author	Cavallo, Bren
dc.contributor.author	Delgado Rodríguez, Jordi
dc.contributor.author	Kahrobaei, Delaram
dc.contributor.author	Ventura Capell, Enric
dc.date	2016-10-25
dc.identifier.citation	Cavallo, B., Delgado, J., Kahrobaei, D., Ventura, E. Algorithmic recognition of infinite cyclic extensions. "Journal of pure and applied algebra", 25 Octubre 2016.
dc.identifier.citation	0022-4049
dc.identifier.citation	10.1016/j.jpaa.2016.10.008
dc.identifier.uri	http://hdl.handle.net/2117/96690
dc.language.iso	eng
dc.relation	http://www.sciencedirect.com/science/article/pii/S0022404916301803
dc.relation	info:eu-repo/grantAgreement/ES/1PE/MTM2014-54896-P
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups
dc.subject	Group theory
dc.subject	Finite groups
dc.subject	Automorphisms
dc.subject	extension
dc.subject	cyclic extension
dc.subject	decision problem
dc.subject	BNS invariant
dc.subject	undecidability
dc.subject	Grups, Teoria de
dc.subject	Grups finits
dc.subject	Automorfismes
dc.subject	Classificació AMS::20 Group theory and generalizations::20E Structure and classification of infinite or finite groups
dc.subject	Classificació AMS::20 Group theory and generalizations::20F Special aspects of infinite or finite groups
dc.title	Algorithmic recognition of infinite cyclic extensions
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	We prove that one cannot algorithmically decide whether a finitely presented Z-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the equivalence between the isomorphism problem within the subclass of unique Z-extensions, and the semi-conjugacy problem for deranged outer automorphisms.
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