Number of Sylow subgroups in finite groups (Q721704): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q129967068, #quickstatements; #temporary_batch_1726329260436
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1515/jgth-2018-0010 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1515/JGTH-2018-0010 / rank
 
Normal rank

Latest revision as of 01:55, 10 December 2024

scientific article
Language Label Description Also known as
English
Number of Sylow subgroups in finite groups
scientific article

    Statements

    Number of Sylow subgroups in finite groups (English)
    0 references
    0 references
    0 references
    19 July 2018
    0 references
    The authors denote by \(\nu_p(G)\) the number of Sylow \(p\)-subgroups of \(G\). It holds that \(\nu_p(H)\leq \nu_p(G)\) for \(h\leq G\), however \(\nu_p(H)\) does not divide \(\nu_p(G)\) in general. Let \(\mathrm{DivSyl}(p)\) for a finite group \(G\) stand for the property that \(\nu_p(H)\) divides \(\nu_p(G)\) for every subgroup \(H\) of \(G\). In this paper, the main result is the following: Theorem 1.1 (paraphrased). Suppose \(G\) does not satisfy \(\mathrm{DivSyl}(p)\). Then there exists a nonabelian composition factor of \(G\) not satisfying \(\mathrm{DivSyl}(p)\). Theorem 1.1 is an extension to a theorem of \textit{G. Navarro} [Proc. Am. Math. Soc. 131, No. 10, 3019--3020 (2003; Zbl 1030.20010)], he showed Theorem 1.1 to be true for \(p\)-solvable groups \(G\). In order to prove Theorem 1.1, the authors formulate and prove several lemmas and theorems, most of them being rather detailed but useful in their own account. The paper is an enrichment to the vast already known properties of Sylow structures in a finite group.
    0 references
    finite groups
    0 references
    Sylow \(p\)-subgroups
    0 references
    \(p\)-solvable groups
    0 references
    composition series
    0 references
    chief series
    0 references

    Identifiers

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