首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
We prove that if L is a finite Moufang loop and p is a Sylow prime for L then the number of Sylow p-subloops of L is congruent to one modulo p.  相似文献   

2.
Mark Greer 《代数通讯》2013,41(8):3682-3697
We define a new variety of loops, Γ-loops. After showing Γ-loops are power-associative, our main goal is showing a categorical isomorphism between Bruck loops of odd order and Γ-loops of odd order. Once this has been established, we can use the well known structure of Bruck loops of odd order to derive the Odd Order, Lagrange and Cauchy Theorems for Γ-loops of odd order, as well as the nontriviality of the center of finite Γ-p-loops (p odd). Finally, we answer a question posed by Jedli?ka, Kinyon and Vojtěchovský about the existence of Hall π-subloops and Sylow p-subloops in commutative automorphic loops.  相似文献   

3.
In representation theory of finite groups, one of the most important and interesting problems is that, for a p-block A of a finite group G where p is a prime, the numbers k(A) and (A) of irreducible ordinary and Brauer characters, respectively, of G in A are p-locally determined. We calculate k(A) and (A) for the cases where A is a full defect p-block of G, namely, a defect group P of A is a Sylow p-subgroup of G and P is a nonabelian metacyclic p-group M n+1(p) of order p n+1 and exponent p n for n \geqslant 2{n \geqslant 2}, and where A is not necessarily a full defect p-block but its defect group PM n+1(p) is normal in G. The proof is independent of the classification of finite simple groups.  相似文献   

4.
Let F be an algebraically closed field of characteristic zero and L an RA loop. We prove that the loop algebra FL is in the variety generated by the split Cayley–Dickson algebra Z F over F. For RA2 loops of type M(Dih(A), ?1,g 0), we prove that the loop algebra is in the variety generated by the algebra 3 which is a noncommutative simple component of the loop algebra of a certain RA2 loop of order 16. The same does not hold for the RA2 loops of type M(G, ?1,g 0), where G is a non-Abelian group of exponent 4 having exactly 2 squares.  相似文献   

5.
Let G be a non-abelian group and associate a non-commuting graph ∇(G) with G as follows: the vertex set of ∇(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L 2(q) (q = p n , p is a prime), then GM.   相似文献   

6.
Guohua Qian 《代数通讯》2013,41(12):5183-5194
Let G be a finite group and M n (G) be the set of n-maximal subgroups of G, where n is an arbitrary given positive integer. Suppose that M n (G) contains a nonidentity member and all members in M n (G) are S-permutable in G. Then any of of the following conditions guarantees the supersolvability of G: (1) M n (G) contains a nonidentity member whose order is not a prime; (2) all nonidentity members in M n (G) are of prime order, and all cyclic members in M n?1(G) of order 4 are S-permutable in G.  相似文献   

7.
Let χ t (G) and †(G) denote respectively the total chromatic number and maximum degree of graphG. Yap, Wang and Zhang proved in 1989 that ifG is a graph of orderp having †(G)≥p−4, then χ t (G≤Δ(G)+2. Hilton has characterized the class of graphG of order 2n having †(G)=2n−1 such that χ t (G=Δ(G)+2. In this paper, we characterize the class of graphsG of order 2n having †(G)=2n−2 such that χ t (G=Δ(G)+2 Research supported by National Science Council of the Republic of China (NSC 79-0208-M009-15)  相似文献   

8.
Let M n be a closed orientable manifold of dimension n > 3. We study the class G 1(M n ) of orientation-preserving Morse-Smale diffeomorphisms of M n such that the set of unstable separatrices of any fG 1(M n ) is one-dimensional and does not contain heteroclinic intersections. We prove that the Peixoto graph (equipped with an automorphism) is a complete topological invariant for diffeomorphisms of class G 1(M n ), and construct a standard representative for any class of topologically conjugate diffeomorphisms.  相似文献   

9.
Let G be an infinite pro-p-group of finite coclass and let M(G) be its Schur multiplicator. For p > 2, we determine the isomorphism type of Hom(M(G), ℤp), where ℤp denotes the p-adic integers, and show that M(G) is infinite. For p = 2, we investigate the Schur multiplicators of the infinite pro-2-groups of small coclass and show that M(G) can be infinite, finite or even trivial.  相似文献   

10.
We consider finite groups G for which any two cyclic subgroups of the same order are conjugate in G. We prove various structure results and, in particular, that any such group has at most one non-abelian composition factor, and this is isomorphic to PSL(2, p m ), with m odd if p is odd, or to Sz(22m+1), or to one of the sporadic groups M 11, M 23, or J 1.  相似文献   

11.
By 𝔛(n) we denote the variety of all groups satisfying the law [x,y]n≡1, that is, groups with commutators of order dividing n. Let p be a prime and G a finite group whose Sylow p-subgroups have normal series of length k all of whose quotients belong to 𝔛(n). We show that the non-p-soluble length λp(G) of G is bounded in terms of k and n only (Theorem 1.2). In the case where p is odd, a stronger result is obtained (Theorem 1.3).  相似文献   

12.
Let G be a finite abelian group and its Sylow p-subgroup a direct product of copies of a cyclic group of order p~r,i.e.,a finite homocyclic abelian group.LetΔ~n (G) denote the n-th power of the augmentation idealΔ(G) of the integral group ring ZG.The paper gives an explicit structure of the consecutive quotient group Q_n(G)=Δ~n(G)/Δ~(n 1)(G) for any natural number n and as a consequence settles a problem of Karpilovsky for this particular class of finite abelian groups.  相似文献   

13.
Let ? be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ?-S-semipermutable if H permutes with every Sylow p-subgroup of G in ? for all p?π(H); H is said to be ?-S-seminormal if it is normalized by every Sylow p-subgroup of G in ? for all p?π(H). The main aim of this paper is to characterize the ?-MS-groups, or groups G in which the maximal subgroups of every Sylow subgroup in ? are ?-S-semipermutable in G and the ?-MSN-groups, or groups in which the maximal subgroups of every Sylow subgroup in ? are ?-S-seminormal in G.  相似文献   

14.
Let G be the direct sum of the noncyclic groupof order four and a cyclic groupwhoseorderisthe power pn of some prime p. We show that ℤ2 G‐lattices have a decidable theory when the cyclotomic polynomia (x) is irreducible modulo 2ℤ for every jn. More generally we discuss the decision problem for ℤ2 G‐lattices when G is a finite group whose Sylow 2‐subgroups are isomorphic to the noncyclic group of order four.  相似文献   

15.
Mark L. Lewis 《代数通讯》2013,41(5):1994-2002
In this article, we show that if p is a prime and G is a p-solvable group, then |G: O p (G)| p  ≤ (b(G) p /p)1/(p?1), where b(G) is the largest character degree of G. If p is an odd prime that is not a Mersenne prime or if the nilpotence class of a Sylow p-subgroup of G is at most p, then |G: O p (G)| p  ≤ b(G).  相似文献   

16.
In Tong-Viet's, 2012 work, the following question arose: Question. Which groups can be uniquely determined by the structure of their complex group algebras?

It is proved here that some simple groups of Lie type are determined by the structure of their complex group algebras. Let p be an odd prime number and S = PSL(2, p 2). In this paper, we prove that, if M is a finite group such that S < M < Aut(S), M = ?2 × PSL(2, p 2) or M = SL(2, p 2), then M is uniquely determined by its order and some information about its character degrees. Let X 1(G) be the set of all irreducible complex character degrees of G counting multiplicities. As a consequence of our results, we prove that, if G is a finite group such that X 1(G) = X 1(M), then G ? M. This implies that M is uniquely determined by the structure of its complex group algebra.  相似文献   

17.
Let G be a finite group, and let π e (G) be the spectrum of G, that is, the set of all element orders of G. In 1987, Shi Wujie put forward the following conjecture. If G is a finite group and M is a non-abelian simple group, then GM if and only if |G| = |M| and π e (G) = π e (M). In this short paper, we prove that if G is a finite group, then GM if and only if |G| = |M| and π e (G) = π e (M), where M = D n (2) and n is even.  相似文献   

18.
19.
We look at the structure of a soluble group G depending on the value of a function m(G)= max m p G), where m p(G)=max{logp|G:M| | M< G, |G:M|=p a}, p (G). Theorem 1 states that for a soluble group G, (1) r(G/ (G))= m(G); (2) d(G/ (G)) 1+ (m(G)) 3+m(G); (3) l p(G) 1+t, where 2t-1<m p(G) 2t. Here, (G) is the Frattini subgroup of G, and r(G), d(G), and l p(G) are, respectively, the principal rank, the derived length, and the p-length of G. The maximum of derived lengths of completely reducible soluble subgroups of a general linear group GL(n,F) of degree n, where F is a field, is denoted by (n). The function m(G) allows us to establish the existence of a new class of conjugate subgroups in soluble groups. Namely, Theorem 2 maintains that for any natural k, every soluble group G contains a subgroup K possessing the following properties: (1) m(K); k; (2) if T and H are subgroups of G such that K T <max <max H G then |H:T|=p t for some prime p and for t>k. Moreover, every two subgroups of G enjoying (1) and (2) are mutually conjugate.  相似文献   

20.
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ=(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of a graph G with k′ colors is said to be the equitable chromatic threshold of G and is denoted by χ=*(G). In this paper, we investigate the asymptotic behavior of these coloring parameters in the probability space G(n,p) of random graphs. We prove that if n?1/5+? < p < 0.99 for some 0 < ?, then almost surely χ(G(n,p)) ≤ χ=(G(n,p)) = (1 + o(1))χ(G(n,p)) holds (where χ(G(n,p)) is the ordinary chromatic number of G(n,p)). We also show that there exists a constant C such that if C/n < p < 0.99, then almost surely χ(G(n,p)) ≤ χ=(G(n,p)) ≤ (2 + o(1))χ(G(n,p)). Concerning the equitable chromatic threshold, we prove that if n?(1??) < p < 0.99 for some 0 < ?, then almost surely χ(G(n,p)) ≤ χ=* (G(n,p)) ≤ (2 + o(1))χ(G(n,p)) holds, and if < p < 0.99 for some 0 < ?, then almost surely we have χ(G(n,p)) ≤ χ=*(G(n,p)) = O?(χ(G(n,p))). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009  相似文献   

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

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