NAGIOS: RODERIC FUNCIONANDO

Algorithms for permutability in finite groups

Repositori DSpace/Manakin

dc.contributor.author	Ballester-Bolinches, Adolfo
dc.contributor.author	Cosme i Llópez, Enric
dc.contributor.author	Esteban Romero, Ramón
dc.date.accessioned	2015-09-28T07:28:53Z
dc.date.available	2015-09-28T07:28:53Z
dc.date.issued	2013
dc.identifier.citation	Ballester Bolinches, Adolfo Cosme Llópez, Enric Esteban Romero, Ramón 2013 Algorithms for permutability in finite groups Central European Journal Of Mathematics 11 11 1914 1922
dc.identifier.uri	http://hdl.handle.net/10550/47305
dc.description.abstract	In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.
dc.language.iso	eng
dc.relation.ispartof	Central European Journal Of Mathematics, 2013, vol. 11, num. 11, p. 1914-1922
dc.subject	Àlgebra
dc.subject	Grups, Teoria de
dc.title	Algorithms for permutability in finite groups
dc.type	journal article	es_ES
dc.date.updated	2015-09-28T07:28:54Z
dc.identifier.doi	10.2478/s11533-013-0222-z
dc.identifier.idgrec	095977
dc.rights.accessRights	open access	es_ES