首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到17条相似文献,搜索用时 78 毫秒
1.
OD-characterization of Almost Simple Groups Related to U3(5)   总被引:1,自引:0,他引:1  
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.  相似文献   

2.
A RECOGNITION OF SIMPLE GROUPS PSL(3, q) BY THEIR ELEMENT ORDERS   总被引:2,自引:0,他引:2  
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.  相似文献   

3.
In this paper the following theorem is proved: Every group L3(q) for q = 3^(2m-1)(m≥2) is characterized by its set of element orders.  相似文献   

4.
本文证明了以下结果:设α1,α2,α3,α4,α5均为正整数,p为素数且.如果G是阶为的单群,则G同构于下列单群之一:A11,A12;M22,Hi-S2McL,He;A1(q)(q=26,53,74,29,41,71,251,449,4801),A2(32),A3(22),A3(7),A4(2),A5(2),B2(23),B2(72),B3(3),B4(2),C3(3),D4(3),G2(2),G2(5),2A2(19),2A3(5),2A3(7),2A4(3),2A5(2),2D4(2).  相似文献   

5.
王殿军 《数学学报》1994,37(5):601-606
本文证明了非单群系列SL(2,q)(q=p ̄n>3)可以仅用其极大子群阶之集来刻划,从而得到了SL(2,q)的一个特征性质.  相似文献   

6.
It is proved that if D be a 2-(v,k,1) design with G≤Aut D block primitive then G does not have a Suzuki group Sz(q) as the socle.  相似文献   

7.
EXPLICITCONSTRUCTIONOFHARMONICMAPSFROMR~2TOU(N)¥GuCHAOHAOHuHESHENGAbstract:Darbouxtransformationmethodisusedforconstructingha?..  相似文献   

8.
ONTHECLASSIFICATIONOFAF-ALGEBRASANDTHEIRDIMENSIONGROUPS(Ⅱ)¥HUANGZHAOBOAbstract:Thispaperisacontinuationof[1].Itgivessomeappli...  相似文献   

9.
对于任意一个有限群G,令π(G)表示由它的阶的所有素因子构成的集合.构建一种与之相关的简单图,称之为素图,记作Γ(G).该图的顶点集合是π(G),图中两顶点p,g相连(记作p~q)的充要条件是群G恰有pq阶元.设π(G)={P1,p2,…,px}.对于任意给定的p∈π(G),令deg(p):=|{q∈π(G)|在素图Γ(G)中,p~q}|,并称之为顶点p的度数.同时,定义D(G):=(deg(p1),deg(p2),…,deg(ps)),其中p12<…相似文献   

10.
设G是有限群,πs(G)为G的极大子群阶之集.本文证明了若q=pn>2,p素,则G≌L2(q)当且仅当πs(G)=πs(L2(q)).对一些其它的单群也证明了同样的结论.  相似文献   

11.
晏燕雄  陈贵云 《数学研究》2012,45(2):175-178
利用有限群的阶和它的次数型分别对对称群S51和S_(52)进行了刻画,得到:对称群S_(51)和S_(52)均可3-重OD-刻画.  相似文献   

12.
Let M be a simple group whose order is less than 108. In this paper, we prove that if G is a finite group with the same order and degree pattern as M, then the following statements hold: (a) If MA 10, U 4(2), then GM; (b) If M = A 10, then GA 10 or J 2 × ℤ3; (c) If M = U 4(2), then G is isomorphic to a 2-Frobenius group or U 4(2). In particular, all simple groups whose orders are less than 108 but A 10 and U 4(2) are OD-characterizable. As a consequence of this result, we can give a positive answer to a conjecture put forward by W. J. Shi and J. X. Bi in 1990 [Lecture Notes in Mathematics, Vol. 1456, 171–180].   相似文献   

13.
本文研究了基柱同构于2F4(q)的线传递的几乎单群.利用了有限线性空间上线传递的自同构群的经典结论,以及2F4(q)的阶和极大子群等性质,获得了点稳定子群和线稳定子群的分类.  相似文献   

14.
We show that for any graph G, the chromatic number χ(G) ≤ Δ2(G) + 1, where Δ2(G) is the largest degree that a vertex ν can have subject to the condition that ν is adjacent to a vertex whose degree is at least as big as its own. Moreover, we show that the upper bound is best possible in the the following sense: If Δ2(G) ≥ 3, then to determine whether χ(G) ≤ Δ2(G) is an NP‐complete problem. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 117–120, 2001  相似文献   

15.
We prove that if L is one of the simple groups E 6(q) and 2 E 6(q) and G is some finite group with the same spectrum as L, then the commutant of G/F(G) is isomorphic to L and the quotient G/G′ is a cyclic {2,3}-group. Original Russian Text Copyright ? 2007 Kondrat’ev A. S. The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00463) and the RFBR-NSFC (Grant 05-01-39000). __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 6, pp. 1250–1271, November–December, 2007.  相似文献   

16.
设G是有限群,πe(G)表示G中元素的阶的集合,h(πe(G))表示满足πe(H)=πe(G)条件的有限群H的同构类类数,本文证明了例外型Chevalley群G2(q)的h函数值为1或∞.  相似文献   

17.
Let G be a finite group and π(G) be the set of all prime divisors of its order. The prime graph GK(G) of G is a simple graph with vertex set π(G), and two distinct primes p, q ∈ π(G) are adjacent by an edge if and only if G has an element of order pq. For a vertex p ∈ π(G), the degree of p is denoted by deg(p) and as usual is the number of distinct vertices joined to p. If π(G) = {p 1, p 2,...,p k }, where p 1 < p 2 < ... < p k , then the degree pattern of G is defined by D(G) = (deg(p 1), deg(p 2),...,deg(p k )). The group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups H satisfying conditions |H| = |G| and D(H) = D(G). In addition, a 1-fold OD-characterizable group is simply called OD-characterizable. In the present article, we show that the alternating group A 22 is OD-characterizable. We also show that the automorphism groups of the alternating groups A 16 and A 22, i.e., the symmetric groups S 16 and S 22 are 3-fold OD-characterizable. It is worth mentioning that the prime graph associated to all these groups are connected.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号