The problem of recognition of finite simple groups by element orders is solved
Maria A. Grechkoseeva, Alexey M. Staroletov, Andrey V. Vasil'ev
Abstract
For a finite group G, let ω(G) be the set of element orders of G and let h(G) be the number of pairwise nonisomorphic finite groups H with ω(H)=ω(G). We say that the recognition problem is solved for G if the number h(G) is known, and if it is finite, then all finite groups H with ω(H)=ω(G) are listed. We complete the solution of the recognition problem for all finite simple groups.
Create a lesson
Related papers
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng
Finite groups with large power-avoiding subsets
Simon R. Blackburn, Sarah B. Hart, Daniel McVeagh
Involution and Commutator Length in PU(n,1)
Zhongqi Wang, Shihai Yang
Quandles associated with group actions
Ryoya Kai
Uncountably many local isomorphism types of compactly generated simple groups
Ilaria Castellano, Jorge Fariña-Asategui, Mikel Eguzki Garciarena et al.
A classification of finite simply reducible groups of order at most 2000
Yongzhi Luan