On Nearly S-Permutable Subgroups of Finite Groups

We say that a subgroup H of a finite group G is nearly S-permutable in G if for every prime p such that (p, |H|) = 1 and for every subgroup K of G containing H the normalizer N _K (H) contains some Sylow p-subgroup of K. We study the structure of G under the assumption that some subgroups of G are nearly S-permutable in G.     

On the n-minimal subgroups

Let G be a finite group and n be a positive integer. An n-minimal subgroup H of G is called to be exactly n-minimal if no proper subgroup of H is n-minimal. In this paper, we study the solvability of G under the assumption that all exactly n-minimal subgroups of G are S-permutable.     

Recognition of some symmetric groups by the set of the order of their elements

For a finite group G, let π_e(G) be the set of order of elements in G and denote S _n the symmetric group on n letters. We will show that if π_e(G ) = π_e(H), where H is S _p or S _p+1 and p is a prime with 50 < p < 100, then G ≅ H. This revised version was published online in August 2006 with corrections to the Cover Date.     

On SQ-Supplemented Subgroups of Finite Groups

Let G be a finite group and H ≤ G. The subgroup H is called: S-permutable in G if HP = PH for all Sylow subgroups P of G; S-permutably embedded in G if each Sylow subgroup of H is also a Sylow subgroup of some S-permutable subgroup of G.

Let H be a subgroup of a group G. Then we say that H is SQ-supplemented in G if G has a subgroup T and an S-permutably embedded subgroup C ≤ H such that HT = G and T ∩ H ≤ C.

We study the structure of G under the assumption that some subgroups of G are SQ-supplemented in G. Some known results are generalized.     

Finite groups with S-permutable n-minimal subgroups

We study the supersolvability of finite groups and the nilpotent length of finite solvable groups under the assumption that all their exactly n-minimal subgroups are S-permutable, where n is an arbitrary integer.     

Indices of Maximal Subgroups of Finite Soluble Groups

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{log_p|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 2^t-1<m _p(G) 2^t. 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.     

Some Extensions of PSL(2, p 2) are Uniquely Determined by Their Complex Group Algebras

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 ²). In this paper, we prove that, if M is a finite group such that S < M < Aut(S), M = ?₂ × PSL(2, p ²) or M = SL(2, p ²), then M is uniquely determined by its order and some information about its character degrees. Let X ₁(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 ₁(G) = X ₁(M), then G ? M. This implies that M is uniquely determined by the structure of its complex group algebra.     

On the prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis>) where <Emphasis Type="Italic">p</Emphasis> > 3 is a prime number

Let G be a finite group. We define the prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph. The third author was supported in part by a grant from IPM (No. 84200024).     

Free subgroups in maximal subgroups of GLn(D)

Let D be a noncommutative finite dimensional F-central division algebra and M a noncommutative maximal subgroup of GL_n(D). It is shown that either M contains a noncyclic free subgroup or M is absolutely irreducible and there exists a unique maximal subfield K of M_n(D) such that K*M, K∕F is Galois with Gal(K∕F)?M∕K* and Gal(K∕F) is a finite simple group.     

The Augmentation Quotients of the Groups of Order 25, II

We have described the structure of Q _n (G) = Δ ⁿ (G)/Δ ⁿ⁺¹(G) for 35 particular classes of groups G with order 2⁵ in the previous article. In this article, the structure of Q _n (G) for all the remaining classes of groups G with order 2⁵ are presented.     

On the maximal subgroup of the sandwich semigroup of generalized circulant Boolean matrices

Let n be a positive integer, and C _n (r) the set of all n × n r-circulant matrices over the Boolean algebra B = {0, 1}, . For any fixed r-circulant matrix C (C ≠ 0) in G _n , we define an operation “*” in G _n as follows: A * B = ACB for any A, B in G _n , where ACB is the usual product of Boolean matrices. Then (G _n , *) is a semigroup. We denote this semigroup by G _n (C) and call it the sandwich semigroup of generalized circulant Boolean matrices with sandwich matrix C. Let F be an idempotent element in G _n (C) and M(F) the maximal subgroup in G _n (C) containing the idempotent element F. In this paper, the elements in M(F) are characterized and an algorithm to determine all the elements in M(F) is given.     

Finite arithmetic subgroups ofGL n,III

LetG be an algebraic group inGL _n (C) defined over Q, andK an algebraic number field with the maximal orderO _k . If the groupG(O _k ) of rational points ofG inM _n (O _k ) is a finite group and if it satisfies a certain condition, which is satisfied, for example, whenK is a nilpotent extension of Q and 2 is unramified, thenG(O _k ) is generated by roots of unity inK andG(Z). Dedicated to the memory of Professor K G Ramanathan     

A new characterization of L 2(q) by its noncommuting graph

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 ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

The Augmentation Quotients of the Groups of Order 25, I

In this article we present the nth power Δ ⁿ (G) of the augmentation ideal Δ(G) and describe the structure of Q _n (G) = Δ ⁿ (G)/Δ ⁿ⁺¹(G) for 35 particular groups G of order 2⁵. The structure of Q _n (G) for all the remaining groups of order 2⁵ will be determined in a forthcoming article.     

On solubility and supersolubility of some classes of finite groups

Let G be a finite group and H a subgroup of G. Then H is said to be S-permutable in G if HP = PH for all Sylow subgroups P of G. Let HsG be the subgroup of H generated by all those subgroups of H which are S-permutable in G. Then we say that H is S-embedded in G if G has a normal subgroup T and an S-permutable subgroup C such that T ∩ H HsG and HT = C. Our main result is the following Theorem A. A group G is supersoluble if and only if for every non-cyclic Sylow subgroup P of the generalized Fitting subgrou...     

Steiner centers and Steiner medians of graphs

Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d_G(S) or d(S). The Steiner n-eccentricity e_n(v) and Steiner n-distance d_n(v) of a vertex v in G are defined as e_n(v)=max{d(S)| SV(G), |S|=n and vS} and d_n(v)=∑{d(S)| SV(G), |S|=n and vS}, respectively. The Steiner n-center C_n(G) of G is the subgraph induced by the vertices of minimum n-eccentricity. The Steiner n-median M_n(G) of G is the subgraph induced by those vertices with minimum Steiner n-distance. Let T be a tree. Oellermann and Tian [O.R. Oellermann, S. Tian, Steiner centers in graphs, J. Graph Theory 14 (1990) 585–597] showed that C_n(T) is contained in C_n+1(T) for all n2. Beineke et al. [L.W. Beineke, O.R. Oellermann, R.E. Pippert, On the Steiner median of a tree, Discrete Appl. Math. 68 (1996) 249–258] showed that M_n(T) is contained in M_n+1(T) for all n2. Then, Oellermann [O.R. Oellermann, On Steiner centers and Steiner medians of graphs, Networks 34 (1999) 258–263] asked whether these containment relationships hold for general graphs. In this note we show that for every n2 there is an infinite family of block graphs G for which C_n(G)C_n+1(G). We also show that for each n2 there is a distance–hereditary graph G such that M_n(G)M_n+1(G). Despite these negative examples, we prove that if G is a block graph then M_n(G) is contained in M_n+1(G) for all n2. Further, a linear time algorithm for finding the Steiner n-median of a block graph is presented and an efficient algorithm for finding the Steiner n-distances of all vertices in a block graph is described.     

On Groups with Finite Involution and Locally Finite 2-Isolated Subgroup of Even Period

A proper subgroup H of a group G is said to be strongly isolated if it contains the centralizer of any nonidentity element of H and 2-isolated if the conditions >C _G(g) H 1 and 2(C_G(g)) imply that C_G(g)H. An involution i in a group G is said to be finite if |ii ^g| < (for any g G). In the paper we study a group G with finite involution i and with a 2-isolated locally finite subgroup H containing an involution. It is proved that at least one of the following assertions holds:1) all 2-elements of the group G belong to H;2) (G,H) is a Frobenius pair, H coincides with the centralizer of the only involution in H, and all involutions in G are conjugate;3) G=FFC_G(i) is a locally finite Frobenius group with Abelian kernel F;4) H=V D is a Frobenius group with locally cyclic noninvariant factor D and a strongly isolated kernel V, U=O₂(V) is a Sylow 2-subgroup of the group G, and G is a Z-group of permutations of the set =U ^g g G.     

Nilpotent Length of a Finite Solvable Group with a Frobenius Group of Automorphisms

We prove that a finite solvable group G admitting a Frobenius group FH of automorphisms of coprime order with kernel F and complement H such that [G, F] = G and C _{C G (F)}(h) = 1 for all nonidentity elements h ∈ H, is of nilpotent length equal to the nilpotent length of the subgroup of fixed points of H.     

A Remark on З-Permutability of Finite Groups

Let З be a complete set of Sylow subgroups of a finite group G, that is, З contains exactly one and only one Sylow p-subgroup of G for each prime p. A subgroup of a finite group G is said to be З-permutable if it permutes with every member of З. Recently, using the Classification of Finite Simple Groups, Heliel, Li and Li proved tile following result： If the cyclic subgroups of prime order or order 4 iif p = 2） of every member of З are З-permutable subgroups in G, then G is supersolvable. In this paper, we give an elementary proof of this theorem and generalize it in terms of formation.