On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number. (Q950285): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10474-007-6021-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3684278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Diophantine equation which arises in the theory of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of the Augmentation Ideal and of the Relation Modules of a Finite Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Prime Graph of a Sporadic Simple Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Groups in Which Every Element Has Prime Power Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of the simple groups of Lie type over the field of even characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of \(\text{PSL}(3,q)\) where \(q\) is an odd prime power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4652058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3544754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5438373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIME GRAPH COMPONENTS OF FINITE SIMPLE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of the prime graph of a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of finite almost simple groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of the alternating groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5733621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups Having Strongly Self-Centralizing 3-Centralizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Groups with Nilpotent Centralizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of finite groups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10474-007-6021-X / rank
 
Normal rank

Latest revision as of 09:28, 10 December 2024

scientific article
Language Label Description Also known as
English
On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
scientific article

    Statements

    On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number. (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2008
    0 references
    The prime graph of a group \(G\) is a graph whose vertices are the primes which divide \(|G|\) and \(pq\) is an edge if there is an element \(x\in G\), \(o(x)=pq\). Let \(G=\text{PSL}(2,p)\), \(p\) a prime \(p\equiv 3\pmod 4\) and \(S\) an arbitrary finite group. Assume that \(G\) and \(S\) have isomorphic prime graphs, then the authors show that either \(S=\text{PSL}(2,p)\) or \(p=7\) or 11 and \(G/O_2(G)\cong\text{PSL}(2,8)\) in the first case or \(M_{11}\) in the second. The proof as usual in this area goes via the Kegel-Gruenberg result, which then basically reduces the proof to simple groups \(S\) and then using the classification of the finite simple groups and a case by case analysis gives then the result. At the end of the paper a similar result for \(p\equiv 1\pmod 4\) is stated and a sketch of a proof is given.
    0 references
    0 references
    finite simple groups
    0 references
    prime graphs
    0 references
    element orders
    0 references
    linear groups
    0 references

    Identifiers

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