On permutable subgroups of finite groups. (Q1401597): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Mohamed Asaad / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Marian Deaconescu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00013-003-0782-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003813232 / rank
 
Normal rank

Latest revision as of 23:33, 19 March 2024

scientific article
Language Label Description Also known as
English
On permutable subgroups of finite groups.
scientific article

    Statements

    On permutable subgroups of finite groups. (English)
    0 references
    0 references
    0 references
    18 August 2003
    0 references
    If \(G\) is a finite group, let \(S\) be a complete set of Sylow subgroups of \(G\), that is, \(S\) contains exactly one Sylow \(p\)-subgroup \(G_p\) for every \(p\in\pi(G)\). A subgroup of \(G\) is called S-permutable if it commutes with all elements of \(S\). The main result of this paper reads as follows: Theorem. Fix a complete set \(S\) of Sylow subgroups of \(G\). If \(\mathcal F\) is a saturated formation containing the supersolvable groups, then the following statements are equivalent: (i) \(G\in\mathcal F\). (ii) There exists \(H\triangleleft G\) such that \(G/H\in\mathcal F\) and the maximal subgroups of \(G_p\cap H\) are S-permutable subgroups of \(G\) for all \(G_p\in S\).
    0 references
    complete sets of Sylow subgroups
    0 references
    supersolvable groups
    0 references
    permutable subgroups
    0 references
    saturated formations
    0 references
    maximal subgroups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references