Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

Algorithms for permutability in finite groups

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.

Maximal subgroups and PST-groups

A subgroup H of a group G is said to permute with a subgroup K of G if HK is a subgroup of G. H is said to be permutable (resp. S-permutable) if it permutes with all the subgroups (resp. Sylow subgroups) of G. Finite groups in which permutability (resp. S-permutability) is a transitive relation are called PT-groups (resp. PST-groups). PT-, PST- and T-groups, or groups in which normality is transitive, have been extensively studied and characterised. Kaplan [Kaplan G., On T-groups, supersolvable...

Page 1

Download Results (CSV)