Algorithms for permutability in finite groups
NAGIOS: RODERIC FUNCIONANDO

Algorithms for permutability in finite groups

DSpace Repository

Algorithms for permutability in finite groups

Show full item record

View       (506.1Kb)

Exportar a Refworks
    
Ballester-Bolinches, Adolfo Perfil; Cosme i Llópez, Enric; Esteban Romero, Ramón Perfil
This document is a artículoDate2013
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.

    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
http://dx.doi.org/10.2478/s11533-013-0222-z
distribuido bajo licencia Creative Commons de Reconocimiento-NoComercial 3.0 No adaptada

This item appears in the following Collection(s)

Show full item record

Search DSpace

Advanced Search

Browse

Statistics