The nilpotent probability of finite groups (Q6986580)

From MaRDI portal
!
WARNING

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 8037510
Language Label Description Also known as
default for all languages
No label defined
    English
    The nilpotent probability of finite groups
    scientific article; zbMATH DE number 8037510

      Statements

      The nilpotent probability of finite groups (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      11 May 2025
      0 references
      For a finite group \(G\), denote by \(\nu(G)\) the probability that two elements generate a nilpotent subgroup. The paper under review is concerned with properties of a finite group that can be deduced from a lower bound on \(\nu(G)\), or \(\nu(H)\) for a subgroup \(H\) of \(G\). \N\NTheorem 1.2 states that if \(p\) is a prime dividing the order of the finite group \(G\) and there is a soluble subgroup \(H\) of \(G\) such that \(\nu(H) > \lvert G : H \rvert / p\), then \(G\) is \(p\)-closed. Theorem 1.3 states that if \(G\) is finite group, and there is a soluble subgroup \(H\) of \(G\) such that \(\nu(H) > \lvert G : H \rvert / 3\), then \(G\) is supersoluble, and the normal \(2\)-complement is nilpotent. The paper also presents other results (Theorems 1.4 and 1.5) with more specific conditions. \N\NThe authors note that the techniques developed in this paper could be useful in exploring a conjecture by [\textit{H. Madadi} et al., Kyungpook Math. J. 63, No. 2, 167--173 (2023; Zbl 1523.20036)] about an upper bound for \(\nu(G)\) for a finite, soluble, non-nilpotent group.
      0 references
      finite group
      0 references
      nilpotent probability
      0 references
      \(p\)-closed group
      0 references
      supersolvable group
      0 references
      \(p\)-nilpotent group
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references