NAGIOS: RODERIC FUNCIONANDO

Algorithms for permutability in finite groups

Repositori DSpace/Manakin

Valencià Castellano

IMPORTANT: Aquest repositori està en una versió antiga des del 3/12/2023. La nova instal.lació está en https://roderic.uv.es/

Algorithms for permutability in finite groups

Mostra el registre complet de l'element

Visualització (506.1Kb)

Ballester-Bolinches, Adolfo; Cosme i Llópez, Enric; Esteban Romero, Ramón

Aquest document és un/a article, creat/da en: 2013

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.

Veure al catàleg Trobes