The Deskins index complex and the supersolvability of finite groups (Q1964002): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q766683
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: W. E. Deskins / 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.1016/s0022-4049(98)00060-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028616741 / rank
 
Normal rank

Latest revision as of 09:00, 30 July 2024

scientific article
Language Label Description Also known as
English
The Deskins index complex and the supersolvability of finite groups
scientific article

    Statements

    The Deskins index complex and the supersolvability of finite groups (English)
    0 references
    0 references
    17 September 2000
    0 references
    A completion of a maximal subgroup \(M\) of finite group \(G\) is a subgroup \(C\) of \(G\) not contained in \(M\) such that every proper subgroup of \(C\) which is normal in \(G\) lies in \(M\), and \(C\) is a maximal completion of \(M\) if it is properly contained in no other completion of \(M\). The author characterizes supersolvable finite groups \(G\) in terms of completions of maximal subgroups of composite index. Theorem 2. A finite group \(G\) is supersolvable if and only if for each maximal subgroup \(M\) of \(G\) of composite index there exists a maximal completion \(C\) such that \(G=CM\) and \(C/\kappa(C)\) has square-free order, where \(\kappa(C)\) denotes the product of all proper subgroups of \(C\) which are normal in \(G\).
    0 references
    supersolvable finite groups
    0 references
    completions of maximal subgroups
    0 references
    maximal completions
    0 references
    0 references

    Identifiers

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