Algorithms for permutability in finite groups |
| |
| Authors: | Adolfo Ballester-Bolinches Enric Cosme-Llópez Ramón Esteban-Romero |
| |
| Affiliation: | 1. Departament d’àlgebra, Universitat de València, Dr. Moliner, 50, 46100, Burjassot (València), Spain
2. Institut Universitari de Matemàtica Pura i Aplicada, Universitat Politècnica de València, Camí de Vera, s/n, 46022, València, Spain
|
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
