Nonsolvable groups satisfying the one-prime hypothesis. (Q2643604): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10468-007-9057-2 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10468-007-9057-2 / rank
 
Normal rank

Latest revision as of 12:37, 19 December 2024

scientific article
Language Label Description Also known as
English
Nonsolvable groups satisfying the one-prime hypothesis.
scientific article

    Statements

    Nonsolvable groups satisfying the one-prime hypothesis. (English)
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    A finite group \(G\) is said to satisfy the one-prime hypothesis if the greatest common divisor of any two distinct irreducible character degrees is either \(1\) or a prime number. Using the classification of finite simple groups, all nonsolvable groups satisfying the one-prime hypothesis are classified, and all possible sets of character degrees of such groups are determined. Combining this with earlier work of the first author, it follows that any finite group satisfying the one-prime hypothesis has at most 9 irreducible character degrees, and this bound is sharp. (For non-solvable groups only, the best possible bound turns out to be 8.)
    0 references
    finite groups
    0 references
    irreducible characters
    0 references
    one-prime hypothesis
    0 references
    character degrees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers