Covers and normal covers of finite groups. (Q471878): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
For a noncyclic finite group \(G\), let \(\gamma(G)\) be the smallest positive integer \(k\) such that \(G\) can be written as set-theoretical union of the conjugates of \(k\) suitably chosen proper subgroups. As \(G\) is never the union of all conjugates of one proper subgroup, one has \(\gamma(G)>1\). It is shown (Theorem 4) that for a permutation group \(G\) of degree \(n\), one has \(\gamma(G)\leq (n+2)/2\). Moreover (Theorem 5), groups \(G\) with \(\gamma(G)=2\) are discussed: Assume that, in addition, \(\gamma(G/N)>2\) for every nontrivial normal subgroup \(N\). Then \(G\) has a unique minimal normal subgroup \(S\). If \(G\) is covered by the conjugates of two maximal subgroups, then either one of them must contain \(S\), or \(G\) is almost simple. In the final section, a number of examples for groups \(G\) with \(\gamma(G)=2\) are given, showing that a complete classification of these groups may well be difficult. The paper contains a number of other results relating \(\gamma(G)\) to the covering number \(\sigma(G)\).
Property / review text: For a noncyclic finite group \(G\), let \(\gamma(G)\) be the smallest positive integer \(k\) such that \(G\) can be written as set-theoretical union of the conjugates of \(k\) suitably chosen proper subgroups. As \(G\) is never the union of all conjugates of one proper subgroup, one has \(\gamma(G)>1\). It is shown (Theorem 4) that for a permutation group \(G\) of degree \(n\), one has \(\gamma(G)\leq (n+2)/2\). Moreover (Theorem 5), groups \(G\) with \(\gamma(G)=2\) are discussed: Assume that, in addition, \(\gamma(G/N)>2\) for every nontrivial normal subgroup \(N\). Then \(G\) has a unique minimal normal subgroup \(S\). If \(G\) is covered by the conjugates of two maximal subgroups, then either one of them must contain \(S\), or \(G\) is almost simple. In the final section, a number of examples for groups \(G\) with \(\gamma(G)=2\) are given, showing that a complete classification of these groups may well be difficult. The paper contains a number of other results relating \(\gamma(G)\) to the covering number \(\sigma(G)\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Rolf Brandl / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20E45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20E28 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6370247 / rank
 
Normal rank
Property / zbMATH Keywords
 
conjugacy classes
Property / zbMATH Keywords: conjugacy classes / rank
 
Normal rank
Property / zbMATH Keywords
 
covers of groups
Property / zbMATH Keywords: covers of groups / rank
 
Normal rank
Property / zbMATH Keywords
 
normal covers
Property / zbMATH Keywords: normal covers / rank
 
Normal rank
Property / zbMATH Keywords
 
covering numbers
Property / zbMATH Keywords: covering numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
finite permutation groups
Property / zbMATH Keywords: finite permutation groups / rank
 
Normal rank
Property / zbMATH Keywords
 
finite simple groups
Property / zbMATH Keywords: finite simple groups / rank
 
Normal rank
Property / zbMATH Keywords
 
unions of subgroups
Property / zbMATH Keywords: unions of subgroups / rank
 
Normal rank
Property / zbMATH Keywords
 
coverings of groups
Property / zbMATH Keywords: coverings of groups / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal normal subgroups
Property / zbMATH Keywords: minimal normal subgroups / rank
 
Normal rank

Revision as of 16:51, 30 June 2023

scientific article
Language Label Description Also known as
English
Covers and normal covers of finite groups.
scientific article

    Statements

    Covers and normal covers of finite groups. (English)
    0 references
    0 references
    0 references
    17 November 2014
    0 references
    For a noncyclic finite group \(G\), let \(\gamma(G)\) be the smallest positive integer \(k\) such that \(G\) can be written as set-theoretical union of the conjugates of \(k\) suitably chosen proper subgroups. As \(G\) is never the union of all conjugates of one proper subgroup, one has \(\gamma(G)>1\). It is shown (Theorem 4) that for a permutation group \(G\) of degree \(n\), one has \(\gamma(G)\leq (n+2)/2\). Moreover (Theorem 5), groups \(G\) with \(\gamma(G)=2\) are discussed: Assume that, in addition, \(\gamma(G/N)>2\) for every nontrivial normal subgroup \(N\). Then \(G\) has a unique minimal normal subgroup \(S\). If \(G\) is covered by the conjugates of two maximal subgroups, then either one of them must contain \(S\), or \(G\) is almost simple. In the final section, a number of examples for groups \(G\) with \(\gamma(G)=2\) are given, showing that a complete classification of these groups may well be difficult. The paper contains a number of other results relating \(\gamma(G)\) to the covering number \(\sigma(G)\).
    0 references
    0 references
    conjugacy classes
    0 references
    covers of groups
    0 references
    normal covers
    0 references
    covering numbers
    0 references
    finite permutation groups
    0 references
    finite simple groups
    0 references
    unions of subgroups
    0 references
    coverings of groups
    0 references
    minimal normal subgroups
    0 references

    Identifiers

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