首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
Suppose F is a perfect field of char F = p ≠ 0 and G is an arbitrary abelian multiplicative group with a p-basic subgroup B and p-component G p . Let FG be the group algebra with normed group of all units V(FG) and its Sylow p-subgroup S(FG), and let I p (FG; B) be the nilradical of the relative augmentation ideal I(FG; B) of FG with respect to B. The main results that motivate this article are that 1 + I p (FG; B) is basic in S(FG), and B(1 + I p (FG; B)) is p-basic in V(FG) provided G is p-mixed. These achievements extend in some way a result of N. Nachev (1996) in Houston J. Math. when G is p-primary. Thus the problem of obtaining a (p-)basic subgroup in FG is completely resolved provided that the field F is perfect. Moreover, it is shown that G p (1 + I p (FG; B))/G p is basic in S(FG)/G p , and G(1 + I p (FG; B))/G is basic in V(FG)/G provided G is p-mixed. As consequences, S(FG) and S(FG)/G p are both starred or divisible groups. All of the listed assertions enlarge in a new aspect affirmations established by us in Czechoslovak Math. J. (2002), Math. Bohemica (2004) and Math. Slovaca (2005) as well.  相似文献   

2.
Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B p (3)), where p > 3 is an odd prime, then G @ Bp(3){G\cong B_p(3)} or C p (3). Also if Γ(G) = Γ(B 3(3)), then G @ B3(3), C3(3), D4(3){G\cong B_3(3), C_3(3), D_4(3)}, or G/O2(G) @ Aut(2B2(8)){G/O_2(G)\cong {\rm Aut}(^2B_2(8))}. As a corollary, the main result of the above paper is obtained.  相似文献   

3.
A subgroup H of a given group G is called a hereditarily factorizable subgroup (HF subgroup) if each congruence on H can be extended to some congruence on the entire group G. An arbitrary group G 1 is an HF subgroup of the direct product G 1 × G 2, as well as of the free product G 1 * G 2 of groups G 1 and G 2. In this paper a necessary and sufficient condition is obtained for a factor Gi of Adian’s n-periodic product Π iI n G i of an arbitrary family of groups {G i } iI to be an HF subgroup. We also prove that for each odd n ≥ 1003 any noncyclic subgroup of the free Burnside group B(m, n) contains an HF subgroup isomorphic to the group B(∞, n) of infinite rank. This strengthens the recent results of A.Yu. Ol’shanskii and M. Sapir, D. Sonkin, and S. Ivanov on HF subgroups of free Burnside groups. This result implies, in particular, that each (noncyclic) subgroup of the group B(m, n) is SQ-universal in the class of all groups of period n. Moreover, it turns out that any countable group of period n is embedded in some 2-generated group of period n, which strengthens the previously obtained result of V. Obraztsov. At the end of the paper we prove that the group B(m, n) is distinguished as a direct factor in any n-periodic group in which it is contained as a normal subgroup.  相似文献   

4.
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.  相似文献   

5.
Let G be a finite group, and let B be a p-block of G with defect group D. Let k 0(B) denote the number of ordinary irreducible characters of height 0 in B. In 1984 Olsson proposed a conjecture: k0(B)\leqq |D:D¢|{k_{0}(B)\leqq |D:D'|}. In this paper, we will verify Olsson’s conjecture in the case that D is metacyclic and p is odd.  相似文献   

6.
Let F be a field, A be a vector space over F, GL(F, A) be the group of all automorphisms of the vector space A. A subspace B of A is called nearly G-invariant, if dim F (BFG/B) is finite. A subspace B is called almost G-invariant, if dim F (B/Core G (B)) is finite. In the current article, we study linear groups G such that every subspace of A is either nearly G-invariant or almost G-invariant in the case when G is a soluble p-group where p = char F.  相似文献   

7.
Huiqun Wang  Tyson Moss 《代数通讯》2013,41(11):4655-4659
A finite group G is said to be a B(n, k) group if for any n-element subset {a 1,…, a n } of G, |{a i a j |1 ≤ i, j ≤ n}| ≤k. In this article, we give characterizations of the B(5, 19) 2-groups, and the B(6, k) 2-groups for 21 ≤ k ≤ 28.  相似文献   

8.
For a prime p, we denote by Bn the cyclic group of order pn. Let φ be a faithful irreducible character of Bn, where p is an odd prime. We study the p-group G containing Bn such that the induced character φG is also irreducible. The purpose of this article is to determine the subgroup NG(NG(Bn)) of G under the hypothesis [NG(Bn):Bn]4 ≦ pn.  相似文献   

9.
Let F be a field, A be a vector space over F, and GL(F,A) the group of all automorphisms of the vector space A. A subspace B of A is called nearly G-invariant, if dim F (BFG/B) is finite. A subspace B is called almost G-invariant, if dim F (B/Core G (B)) is finite. In the present article we begin the study of subgroups G of GL(F,A) such that every subspace of A is either nearly G-invariant or almost G-invariant. More precisely, we consider the case when G is a periodic p′-group where p = charF.   相似文献   

10.
Let B\cal B be a p-block of cyclic defect of a Hecke order over the complete ring \Bbb Z[q] áq-1,p ?\Bbb {Z}[q] _{\langle q-1,p \rangle}; i.e. modulo áq-1 ?\langle q-1 \rangle it is a p-block B of cyclic defect of the underlying Coxeter group G. Then B\cal B is a tree order over \Bbb Z[q]áq-1, p ?\Bbb {Z}[q]_{\langle q-1, p \rangle } to the Brauer tree of B. Moreover, in case B\cal B is the principal block of the Hecke order of the symmetric group S(p) on p elements, then B\cal B can be described explicitly. In this case a complete set of non-isomorphic indecomposable Cohen-Macaulay B\cal B-modules is given.  相似文献   

11.
Let G be a connected, complex, semi-simple Lie group Let g be an element in G. Let B be a Borel subgroup of G and g in B. Let m and n be the least positive integers such that the element gm lies on a one-parameter subgroup in G and the element gn lies on a one-parameter subgroup in B. We denote these integers by ind G (g) and ind B (g). In this note we prove the conjecture ind G (g) = ind B (g), if g is regular.  相似文献   

12.
Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all i ≥ 0: (i) exp Ωi(G) ≤ p i for odd p, and expΩi(G) ≤ 2 i+1 for p = 2; (ii) the index |G: G p i| coincides with the number of elements of G of order at most p i. Supported by the Spanish Ministry of Science and Education, grant MTM2004-04665, partly with FEDER funds, and by the University of the Basque Country, grant UPV05/99.  相似文献   

13.
Let G be a finite group, and suppose that B is a p-block of G with defect group D. Let k(B) denote the number of ordinary irreducible characters in B. It was conjectured by Brauer that k(B) ≤ |D|. In this paper, we will prove Brauer’s inequality in the case that D is metacyclic and p is odd.  相似文献   

14.
Mahmut Kuzucuoğlu 《代数通讯》2013,41(10):3253-3262
The present article deals with locally finite groups G having an involution φ such that C G (φ) is an SF-group. It is shown that G possesses a normal subgroup B which is a central product of finitely many groups isomorphic to PSL(2, K i ) or SL(2, K i ) for some infinite locally finite fields K i of odd characteristic, such that [G, φ]′/B and G/[G, φ] are both SF-groups.  相似文献   

15.
Yuanlin Li  Yilan Tan 《代数通讯》2013,41(10):3769-3780
A group G is said to be a B(n, k) group if for any n-element subset {a 1,…, a n } of G, |{a i a j  | 1 ≤ i, j ≤ n}| ≤k. In this article, we give a complete characterization of B(4, 13) 2-groups, and then obtain a complete characterization of B(4, 13) groups.  相似文献   

16.
A graph G is said to be Pt‐free if it does not contain an induced path on t vertices. The i‐center Ci(G) of a connected graph G is the set of vertices whose distance from any vertex in G is at most i. Denote by I(t) the set of natural numbers i, ⌊t/2⌋ ≤ it − 2, with the property that, in every connected Pt‐free graph G, the i‐center Ci(G) of G induces a connected subgraph of G. In this article, the sharp upper bound on the diameter of G[Ci(G)] is established for every iI(t). The sharp lower bound on I(t) is obtained consequently. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 235–241, 1999  相似文献   

17.
A group is said to be p-rigid, where p is a natural number, if it has a normal series of the form G = G 1 > G 2 > … > G p  > G p+1 = 1, whose quotients G i /G i+1 are Abelian and are torsion free when treated as \mathbbZ \mathbb{Z} [G/G i ]-modules. Examples of rigid groups are free soluble groups. We point out a recursive system of universal axioms distinguishing p-rigid groups in the class of p-soluble groups. It is proved that if F is a free p-soluble group, G is an arbitrary p-rigid group, and W is an iterated wreath product of p infinite cyclic groups, then ∀-theories for these groups satisfy the inclusions A(F) ê A(G) ê A(W) \mathcal{A}(F) \supseteq \mathcal{A}(G) \supseteq \mathcal{A}(W) . We construct an ∃-axiom distinguishing among p-rigid groups those that are universally equivalent to W. An arbitrary p-rigid group embeds in a divisible decomposed p-rigid group M = M1,…, α p ). The latter group factors into a semidirect product of Abelian groups A 1 A 2A p , in which case every quotient M i /M i+1 of its rigid series is isomorphic to A i and is a divisible module of rank αi over a ring \mathbbZ \mathbb{Z} [M/M i ]. We specify a recursive system of axioms distinguishing among M-groups those that are Muniversally equivalent to M. As a consequence, it is stated that the universal theory of M with constants in M is decidable. By contrast, the universal theory of W with constants is undecidable.  相似文献   

18.
A finite group G is called p i -central of height k if every element of order p i of G is contained in the k th -term ζ k (G) of the ascending central series of G. If p is odd, such a group has to be p-nilpotent (Thm. A). Finite p-central p-groups of height p − 2 can be seen as the dual analogue of finite potent p-groups, i.e., for such a finite p-group P the group P1(P) is also p-central of height p − 2 (Thm. B). In such a group P, the index of P p is less than or equal to the order of the subgroup Ω1(P) (Thm. C). If the Sylow p-subgroup P of a finite group G is p-central of height p − 1, p odd, and N G (P) is p-nilpotent, then G is also p-nilpotent (Thm. D). Moreover, if G is a p-soluble finite group, p odd, and P ∈ Syl p (G) is p-central of height p − 2, then N G (P) controls p-fusion in G (Thm. E). It is well-known that the last two properties hold for Swan groups (see [11]).  相似文献   

19.
Let O(G) denote the set of odd-degree vertices of a graph G. Let t ? N and let ??t denote the family of graphs G whose edge set has a partition. E(g) = E1 U E2 U … U Etsuch that O(G) = O(G[Ei]) (1 ? i ? t). This partition is associated with a double cycle cover of G. We show that if a graph G is at most 5 edges short of being 4-edge-connected, then exactly one of these holds: G ? ??3, G has at least one cut-edge, or G is contractible to the Petersen graph. We also improve a sufficient condition of Jaeger for G ? ??2p+1(p ? N).  相似文献   

20.
ABSTRACT

In this article, we first consider n × n upper-triangular matrices with entries in a given semiring k. Matrices of this form with invertible diagonal entries form a monoid B n (k). We show that B n (k) splits as a semidirect product of the monoid of unitriangular matrices U n (k) by the group of diagonal matrices. When the semiring is a field, B n (k) is actually a group and we recover a well-known result from the theory of groups and Lie algebras. Pursuing the analogy with the group case, we show that U n (k) is the ordered set product of n(n ? 1)/2 commutative monoids (the root subgroups in the group case). Finally, we give two different presentations of the Schützenberger product of n groups G 1,…, G n , given a monoid presentation ?A i  | R i ? of each group G i . We also obtain as a special case presentations for the monoid of all n × n unitriangular Boolean matrices.  相似文献   

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

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