Some new characterizations of PST-groups

2013/04/30 by Xiaolan Yi, Yi, Xiaolan, Alexander N. Skiba +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #math.GR

paper · pdf · doi:10.48550/arxiv.1304.7902

arxiv created 2013/04/30 · openalex publication_date 2013/04/30 · arxiv updated 2013/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let H and B be subgroups of a finite group G such that G=N_G(H)B. Then we say that H is quasipermutable (respectively S-quasipermutable) in G provided H permutes with B and with every subgroup (respectively with every Sylow subgroup) A of B such that (|H|, |A|)=1. In this paper we analyze the influence of S-quasipermutable and quasipermutable subgroups on the structure of G. As an application, we give new characterizations of soluble PST-groups.

Related

• Finite Groups with Some s-semipermutable subgroups
• On finite PσT-groups
• A contribution to the theory of σ-properties of a finite group
• Finite groups with ℙ-subnormal and strongly permutable subgroups
• p-sylowizers and p-nilpotency of finite groups