Recognition of the linear groups over the binary field by the set of their element orders. (Q949113): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:41, 5 March 2024

scientific article
Language Label Description Also known as
English
Recognition of the linear groups over the binary field by the set of their element orders.
scientific article

    Statements

    Recognition of the linear groups over the binary field by the set of their element orders. (English)
    0 references
    0 references
    0 references
    20 October 2008
    0 references
    This paper adds to a series of papers dealing with the question if a simple group is determined by the orders of its elements. In this papers the author consider \(\text{PSL}_{14}(2)\). The methods of the proof in all such papers are basically the same. As the order graph is not connected the Kegel-Gruenberg Theorem applies and then using the classification of the finite simple groups it is just a case by case investigation.
    0 references
    0 references
    finite simple groups
    0 references
    sets of element orders
    0 references
    order graphs
    0 references
    Kegel-Gruenberg theorem
    0 references
    recognizable groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references