Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） den...Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） denoted .by г（G） （or GK（G））. This graph is constructed as follows： The vertex set of it is π（G） = {p1,p2,…,pk} and two vertices pi, pj with i≠j are adjacent by an edge （and we write pi - pj） if and only if G contains an element of order pipj. The degree deg（pi） of a vertex pj ∈π（G） is the number of edges incident on pi. We define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k non- isomorphic groups H such that ｜H｜ = ｜G｜ and D（H） = D（G）. Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L ：= U3（5） be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S3 is 6-fold OD-characterizable.展开更多
Let G be a finite group and π（G） = {pl,p2,…… ,pk} be the set of the primes dividing the order of G. We define its prime graph F（G） as follows. The vertex set of this graph is 7r（G）, and two distinct vertices ...Let G be a finite group and π（G） = {pl,p2,…… ,pk} be the set of the primes dividing the order of G. We define its prime graph F（G） as follows. The vertex set of this graph is 7r（G）, and two distinct vertices p, q are joined by an edge if and only if pq ∈ πe（G）. In this case, we write p - q. For p ∈π（G）, put deg（p） ：= ｜{q ∈ π（G）｜p - q}｜, which is called the degree of p. We also define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, where pl 〈 p2 〈 -……〈 pk, which is called the degree pattern of G. We say a group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and degree pattern as G. Specially, a l-fold OD-characterizable group is simply called an OD-characterizable group. Let L ：= U6（2）. In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S3 is 5-fold OD-characterizable.展开更多
We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prim...We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prime graphs. Moreover we prove that Wn is a strongly prime graph for every even integer n ≥ 4.展开更多
The Sylow graph of a finite group originates from recent investigations on certain classes of groups, defined in terms of normalizers of Sylow subgroups. The connectivity of this graph has been proved only last year w...The Sylow graph of a finite group originates from recent investigations on certain classes of groups, defined in terms of normalizers of Sylow subgroups. The connectivity of this graph has been proved only last year with the use of the classification of finite simple groups (CFSG). A series of interesting questions arise naturally. First of all, it is not clear whether it is possible to avoid CFSG or not. On the other hand, what happens for infinite groups? Since the status of knowledge of the non-commuting graph and of the prime graph is satisfactory, is it possible to find relations between these two graphs and the Sylow graph? In the present note we make the point of the situation and formulate the above questions in appropriate way.展开更多
Let G be a finite group and Irr(G)the set of all irreducible complex characters of G.Let cd(G)be the set of all irreducible complex character degrees of G and denote byρ(G)the set of all primes which divide some char...Let G be a finite group and Irr(G)the set of all irreducible complex characters of G.Let cd(G)be the set of all irreducible complex character degrees of G and denote byρ(G)the set of all primes which divide some character degree of G.The character-prime graphΓ(G)associated to G is a simple undirected graph whose vertex set isρ(G)and there is an edge between two distinct primes p and q if and only if the product p q divides some character degree of G.We show that the finite nonabelian simple groups A_(7),J_(1),J_(3),J_(4),L_(3)(3)and U_(3)(4)are uniquely determined by their degree-patterns and orders.展开更多
The order components of a finite group are introduced in [12]. In [9], it is proved that the group PSL(3, q), where q is an odd prime power, is uniquely determined by its order components. In this paper, we show that ...The order components of a finite group are introduced in [12]. In [9], it is proved that the group PSL(3, q), where q is an odd prime power, is uniquely determined by its order components. In this paper, we show that the group PSL(3, q), where q=2~m, is also uniquely determined by its order components.展开更多
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 degree pattern of a finite group has been introduced in [18]. A group M is called k-fold OD- characterizable if there exist exactly k non-isomorphic finite groups having the same order and degree pattern as M. In ...The degree pattern of a finite group has been introduced in [18]. A group M is called k-fold OD- characterizable if there exist exactly k non-isomorphic finite groups having the same order and degree pattern as M. In particular, a 1-fold OD-characterizable group is simply called OD-characterizable. It is shown that the alternating groups Am and Am＋l, for m = 27, 35, 51, 57, 65, 77, 87, 93 and 95, are OD-characterizable, while their automorphism groups are 3-fold OD-characterizable. It is also shown that the symmetric groups Sin＋2, for m=7, 13, 19, 23, 31, 37, 43, 47, 53, 61, 67, 73, 79, 83, 89 and 97, are 3-fold OD-characterizable. From this, the following theorem is derived. Let m be a natural number such that m≤100. Then one of the following holds： （a） if m ≠10, then the alternating groups Am are OD-characterizable, while the symmetric groups Sm are ODcharacterizable or 3-fold OD-characterizable; （b） the alternating group A10 is 2-fold OD-characterizable; （c） the symmetric group S10 is 8-fold OD-characterizable. This theorem completes the study of OD-characterizability of the alternating and symmetric groups Am and Sm of degree m≤100.展开更多
[Algebra Colloquium,2005,12(3):431-442]提出与群G的素图有关的次数型D(G).群G称为k-重OD-刻画的,如果恰好有k个不同构的群M使得|G|=|M|且D(G)=D(M).并且1-重OD-刻画的群简称可OD-刻画的.以下单群能被其阶和次数型唯一决定:散在单群,...[Algebra Colloquium,2005,12(3):431-442]提出与群G的素图有关的次数型D(G).群G称为k-重OD-刻画的,如果恰好有k个不同构的群M使得|G|=|M|且D(G)=D(M).并且1-重OD-刻画的群简称可OD-刻画的.以下单群能被其阶和次数型唯一决定:散在单群,交错群A_p(素数p≥5)及某些李型单群.关于群G的素图连通时对该问题的研究比较困难.本文进行了这一研究,证明了对称群S_(81)和S_(82)均是可3-重OD刻画的.另外,本文也证明了交错群A_(130)和A_(140)是可OD-刻画的,该结果对文献[Frontiers of Mathematics in China,2009,4(4):669-680]提出的猜想给予了肯定的回答.展开更多
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,∞}.展开更多
基金Supported by National Natural Science Foundation of China (Grant No. 10871032)the SRFDP of China (Grant No. 20660285002)a subproject of National Natural Science Foundation of China (Grant No. 50674008) (Chongqing University, Nos. 104207520080834, 104207520080968)
文摘Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） denoted .by г（G） （or GK（G））. This graph is constructed as follows： The vertex set of it is π（G） = {p1,p2,…,pk} and two vertices pi, pj with i≠j are adjacent by an edge （and we write pi - pj） if and only if G contains an element of order pipj. The degree deg（pi） of a vertex pj ∈π（G） is the number of edges incident on pi. We define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k non- isomorphic groups H such that ｜H｜ = ｜G｜ and D（H） = D（G）. Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L ：= U3（5） be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S3 is 6-fold OD-characterizable.
基金supported by Natural Science Foundation Project of CQ CSTC (2010BB9206)NNSF of China (10871032)+1 种基金Fundamental Research Funds for the Central Universities (Chongqing University, CDJZR10100009)National Science Foundation for Distinguished Young Scholars of China (11001226)
文摘Let G be a finite group and π（G） = {pl,p2,…… ,pk} be the set of the primes dividing the order of G. We define its prime graph F（G） as follows. The vertex set of this graph is 7r（G）, and two distinct vertices p, q are joined by an edge if and only if pq ∈ πe（G）. In this case, we write p - q. For p ∈π（G）, put deg（p） ：= ｜{q ∈ π（G）｜p - q}｜, which is called the degree of p. We also define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, where pl 〈 p2 〈 -……〈 pk, which is called the degree pattern of G. We say a group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and degree pattern as G. Specially, a l-fold OD-characterizable group is simply called an OD-characterizable group. Let L ：= U6（2）. In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S3 is 5-fold OD-characterizable.
文摘We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prime graphs. Moreover we prove that Wn is a strongly prime graph for every even integer n ≥ 4.
文摘The Sylow graph of a finite group originates from recent investigations on certain classes of groups, defined in terms of normalizers of Sylow subgroups. The connectivity of this graph has been proved only last year with the use of the classification of finite simple groups (CFSG). A series of interesting questions arise naturally. First of all, it is not clear whether it is possible to avoid CFSG or not. On the other hand, what happens for infinite groups? Since the status of knowledge of the non-commuting graph and of the prime graph is satisfactory, is it possible to find relations between these two graphs and the Sylow graph? In the present note we make the point of the situation and formulate the above questions in appropriate way.
基金supported by NSFC(12071484)Hunan Provincial Natural Science Foundation(2020JJ4675)Foundation of Guangdong University of Science and Technology.
文摘Let G be a finite group and Irr(G)the set of all irreducible complex characters of G.Let cd(G)be the set of all irreducible complex character degrees of G and denote byρ(G)the set of all primes which divide some character degree of G.The character-prime graphΓ(G)associated to G is a simple undirected graph whose vertex set isρ(G)and there is an edge between two distinct primes p and q if and only if the product p q divides some character degree of G.We show that the finite nonabelian simple groups A_(7),J_(1),J_(3),J_(4),L_(3)(3)and U_(3)(4)are uniquely determined by their degree-patterns and orders.
文摘The order components of a finite group are introduced in [12]. In [9], it is proved that the group PSL(3, q), where q is an odd prime power, is uniquely determined by its order components. In this paper, we show that the group PSL(3, q), where q=2~m, is also uniquely determined by its order components.
基金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.
基金partially supported by a research grant fromthe Institute for Research in Fundamental Sciences (IPM)
文摘The degree pattern of a finite group has been introduced in [18]. A group M is called k-fold OD- characterizable if there exist exactly k non-isomorphic finite groups having the same order and degree pattern as M. In particular, a 1-fold OD-characterizable group is simply called OD-characterizable. It is shown that the alternating groups Am and Am＋l, for m = 27, 35, 51, 57, 65, 77, 87, 93 and 95, are OD-characterizable, while their automorphism groups are 3-fold OD-characterizable. It is also shown that the symmetric groups Sin＋2, for m=7, 13, 19, 23, 31, 37, 43, 47, 53, 61, 67, 73, 79, 83, 89 and 97, are 3-fold OD-characterizable. From this, the following theorem is derived. Let m be a natural number such that m≤100. Then one of the following holds： （a） if m ≠10, then the alternating groups Am are OD-characterizable, while the symmetric groups Sm are ODcharacterizable or 3-fold OD-characterizable; （b） the alternating group A10 is 2-fold OD-characterizable; （c） the symmetric group S10 is 8-fold OD-characterizable. This theorem completes the study of OD-characterizability of the alternating and symmetric groups Am and Sm of degree m≤100.
基金partially supported by NSFC(No.11171364,No.11271301)the Natural Science Foundation Project of CQ CSTC(No.cstc2011jjA00020)+1 种基金the Fundamental Research Funds for the CentralUniversities(No.XDJK2009C074)Graduate-Innovation Funds of Science of SWU(No.ky2009013)
文摘[Algebra Colloquium,2005,12(3):431-442]提出与群G的素图有关的次数型D(G).群G称为k-重OD-刻画的,如果恰好有k个不同构的群M使得|G|=|M|且D(G)=D(M).并且1-重OD-刻画的群简称可OD-刻画的.以下单群能被其阶和次数型唯一决定:散在单群,交错群A_p(素数p≥5)及某些李型单群.关于群G的素图连通时对该问题的研究比较困难.本文进行了这一研究,证明了对称群S_(81)和S_(82)均是可3-重OD刻画的.另外,本文也证明了交错群A_(130)和A_(140)是可OD-刻画的,该结果对文献[Frontiers of Mathematics in China,2009,4(4):669-680]提出的猜想给予了肯定的回答.
基金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,∞}.
