Addendum to : “Prime graph components of finite almost simple groups” [Rend. Sem. Mat. Univ. Padova 102 (1999), 1–22]
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.
Let ℨ be a complete set of Sylow subgroups of a group G. A subgroup H of G is called ℨ-permutably embedded in G if every Sylow subgroup of H is also a Sylow subgroup of some ℨ-permutable subgroup of G. By using this concept, we obtain some new criteria of p-supersolubility and p-nilpotency of a finite group.
This note contains Sylow's theorem, Lagrange's theorem and Hall's theorem for finite Bruck loops. Moreover, we explore the subloop structure of finite Bruck loops.