2-Covering numbers of finite groups (Q6863049)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8155652
Language Label Description Also known as
default for all languages
No label defined
    English
    2-Covering numbers of finite groups
    scientific article; zbMATH DE number 8155652

      Statements

      2-Covering numbers of finite groups (English)
      0 references
      0 references
      0 references
      6 February 2026
      0 references
      The paper studies \(2\)-coverings of a finite group \(G\), namely sets of proper subgroups such that any pair of elements of \(G\) is contained in at least one subgroup in the set and the invariant \(\sigma_2(G)\), the minimum size of a \(2\)-covering. Let \(d(G)\) be the minimal number of generators of \(G\). It is proved that a \(2\)-covering exists only when \(d(G)\ge 3\) and that \(\sigma_2(G)=\sigma_2(G/\Phi(G))\), where \(\Phi(G)\) is the Frattini subgroup.\N\NFor finite \(p\)-groups with \(d(G)\ge 3\), the authors prove \(\sigma_2(G)=p^2+p+1\), characterized by the existence of a homomorphic image isomorphic to the elementary abelian group of order \(p^3\). Using direct product decompositions, \(\sigma_2(G)\) is determined for all finite nilpotent groups in terms of the smallest prime \(p\) for which the Sylow \(p\)-subgroup has at least three generators.\N\NFor solvable groups, a conjectural form \(\sigma_2(G)=p^{2t}+p^{t}+1\) is proposed, where \(p\) divides \(|G|\) and the Sylow \(p\)-subgroup of a suitable quotient of \(G\) has at least three generators; the formula is verified for several classes. Finally, for finite almost simple groups with \(d(G)>2\), the authors prove that \(\sigma_2(G)=2^2+2+1\).
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references