The author will prove that the group ^2Dp（3） can be uniquely determined by its order components, where p ≠ 2^m ＋ 1 is a prime number, p ≥ 5. More precisely, if OC（G） denotes the set of order components of G, we...The author will prove that the group ^2Dp（3） can be uniquely determined by its order components, where p ≠ 2^m ＋ 1 is a prime number, p ≥ 5. More precisely, if OC（G） denotes the set of order components of G, we will prove OC（G） = OC（^2Dp（3）） if and only if G is isomorphic to ^2Dp（3）. A main consequence of our result is the validity of Thompson＇s conjecture for the groups under consideration.展开更多
For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G i...For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.展开更多
The famous strongly binary Goldbach’s conjecture asserts that every even number 2n ≥ 8 can always be expressible as a sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Spe...The famous strongly binary Goldbach’s conjecture asserts that every even number 2n ≥ 8 can always be expressible as a sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we apply the element order prime graphs of alternating groups of degrees 2n and 2n −1 to characterize this conjecture, and present its six group-theoretic versions;and further prove that this conjecture is true for p +1 and p −1 whenever p ≥ 11 is a prime number.展开更多
For G a finite group,π_e(G)denotes the set of orders of elements in G.If Ω is a subset of the set of natural numbers,h(Ω)stands for the number of isomorphism classes of finite groups with the same set Ω of element...For G a finite group,π_e(G)denotes the set of orders of elements in G.If Ω is a subset of the set of natural numbers,h(Ω)stands for the number of isomorphism classes of finite groups with the same set Ω of element orders.We say that G is k-distinguishable if h(π_(G))=k<∞,otherwise G is called non-distinguishable.Usually,a 1-distinguishable group is called a characterizable group.It is shown that if M is a sporadic simple group different from M_(12),M_(22),J_2,He,Suz,M^cL and O'N, then Aut(M)is charaeterizable by its dement orders.It is also proved that if M is isomorphic to M_(12),M_(22),He,Suz or O'N,then h(π_e(Aut(M)))∈{1,∞}.展开更多
An element g in a finite group G is called a vanishing element if there exists some irreducible complex character x of G such that y(p)=0.Denote by Vo(G)the set of orders of vanishing elements of G,and we prove that G...An element g in a finite group G is called a vanishing element if there exists some irreducible complex character x of G such that y(p)=0.Denote by Vo(G)the set of orders of vanishing elements of G,and we prove that G≌PSL(2,q)if and only if|G|=|PSL(2,q)\and Vo(G)=Vo(PSL(2,q)),where g≥4 is a prime power.展开更多
文摘The author will prove that the group ^2Dp（3） can be uniquely determined by its order components, where p ≠ 2^m ＋ 1 is a prime number, p ≥ 5. More precisely, if OC（G） denotes the set of order components of G, we will prove OC（G） = OC（^2Dp（3）） if and only if G is isomorphic to ^2Dp（3）. A main consequence of our result is the validity of Thompson＇s conjecture for the groups under consideration.
基金This work has been supported by the Research Institute for Fundamental Sciences Tabriz,Iran.
文摘For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.
文摘The famous strongly binary Goldbach’s conjecture asserts that every even number 2n ≥ 8 can always be expressible as a sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we apply the element order prime graphs of alternating groups of degrees 2n and 2n −1 to characterize this conjecture, and present its six group-theoretic versions;and further prove that this conjecture is true for p +1 and p −1 whenever p ≥ 11 is a prime number.
基金This work has been partially sopported by the Research Institute for Fundamental Sciences Tabriz,Iran
文摘For G a finite group,π_e(G)denotes the set of orders of elements in G.If Ω is a subset of the set of natural numbers,h(Ω)stands for the number of isomorphism classes of finite groups with the same set Ω of element orders.We say that G is k-distinguishable if h(π_(G))=k<∞,otherwise G is called non-distinguishable.Usually,a 1-distinguishable group is called a characterizable group.It is shown that if M is a sporadic simple group different from M_(12),M_(22),J_2,He,Suz,M^cL and O'N, then Aut(M)is charaeterizable by its dement orders.It is also proved that if M is isomorphic to M_(12),M_(22),He,Suz or O'N,then h(π_e(Aut(M)))∈{1,∞}.
基金Supported by the National Natural Science Foundation of China(10871032)the SRFDP of China(20060285002)+2 种基金a Subproject of the NNSF of China(50674008)Chongqing Univer-sity(104207520080834104207520080968)
基金This work was supported by the National Natural Science Foundation of China(Grant No.11301218)the Nature Science Fund of Shandong Province(Grant No.ZR2019MA044)the Opening Project of Sichuan Province University Key Laboratory of Bridge Non-destruction Detecting and Engineering Computing(No.2018QZJ04).
文摘An element g in a finite group G is called a vanishing element if there exists some irreducible complex character x of G such that y(p)=0.Denote by Vo(G)the set of orders of vanishing elements of G,and we prove that G≌PSL(2,q)if and only if|G|=|PSL(2,q)\and Vo(G)=Vo(PSL(2,q)),where g≥4 is a prime power.
