On chief factors of finite groups

Let H and K be normal subgroups of a finite group G and let K≤H. If A is a subgroup of G such that AH=AK or A∩H=A∩K, we say that A covers or avoids H/K respectively. The purpose of this paper is to investigate factor groups of a finite group G using this concept. We get some characterizations of a finite group being solvable or supersolvable and generalize some known results.     

Crowns and centralizers of chief factors of finite groups

We give a new proof of Vaserstein’s Pre-stabilization theorem. This theorem describes GL_n (A) ? E(A) when n is just below the stable range for GL_m (A)/E_m (A) The new proof works only for commutative rings (or ideals in such rings) but it does not need assumptions on Krull dimension, like the old proofs did. All one needs is the relevant stable range con-dition. The new ideas in the proof come from Vaserstein’s recent treatment of the case n = 2. (See preceding paper).     

On solvability of groups with a finite nilpotent supercomplemented subgroup

We investigate groups in which every subgroup containing some fixed finite nilpotent subgroup has a complement.     

A solvability criterion for finite groups

We show that if for every prime p, the normalizer of a Sylow p-subgroup of a finite group G admits a p-solvable supplement, then G is solvable. This generalizes a solvability criterion of Hall which asserts that a finite group G is solvable if and only if G has a Hall p′-subgroup for every prime p.     

Nearly m-embedded subgroups and solvability of finite groups

A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups K≤H of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and H∩T≤C≤H. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.     

次正规子群与有限群的超可解性

通过Sylow子群的极大子群和次正规性,利用极小阶反例的方法,得出群p-幂零性和超可解性的结论.本文的创新改进之处在于结合Sylow子群的极大子群和次正规性,研究p-幂零性和超可解性的相关结论.     

Uniquely factorizable elements and solvability of finite groups

In a finite group G every element can be factorized in such a way that there is one factor for each prime divisor p of | G |, and the order of this factor is p^α for some integer α ≧ 0. We define g ∈G to be uniquely factorizable if it has just one such factorization (whose factors must be pairwise commuting). We consider the existence of uniquely factorizable elements and its relation to the solvability of the group. We prove that G is solvable if and only if the set of all uniquely factorizable elements of G is the Fitting subgroup of G. We also prove various sufficient conditions for the non-existence of uniquely factorizable elements in non-solvable groups. Received: 9 June 2005     

Conjugacy class sizes and solvability of finite groups

Let G be a finite group and G?? be the set of primary, biprimary and triprimary elements of G. We prove that if the conjugacy class sizes of G?? are {1,m,n,mn} with positive coprime integers m and n, then G is solvable. This extends a recent result of Kong (Manatsh. Math. 168(2) (2012) 267–271).     

Conjugacy class sizes and solvability of finite groups

Let G be a finite group and let G* be the set of elements of primary, biprimary and triprimary orders of G. We show that suppose that the conjugacy class sizes of G* are exactly {1, p ^a , n, p ^a n} with (p, n)?=?1 and a??? 0, then G is solvable.     

On partial ordering of chief factors in solvable groups

The isomorphism classes of chief factors in a finite solvable group are partially ordered by taking one class higher than the other if a member of the first class appears as a chief factor of the action of the group on a member of the second class. Together with this partial ordering the characteristics of the chief factors are considered. It is shown that the two conditions found by G. Pazderski are not only necessary but also sufficient for a partially ordered set and a function to be representable as the poset of isomorphism classes of chief factors in a finite solvable group with the chief factors having the prescribed characteristics. In addition, the construction yields that every finite distributive lattice is the lattice of normal subgroups of some finite solvable group.     

On complemented nonabelian chief factors of a finite group

The number of chief factors which are complemented in a finite groupG may not be the same in two chief series ofG, despite what occurs with the number of frattini chief factors or of chief factors which are complemented by a maximal subgroup ofG. In this paper we determine the possible changes on that number. These changes can only occur in a certain type of nonabelian chief factors. All groups considered in this paper are assumed to be finite. Both authors were supported in part by DGICYT, PB94-1048.     

A note on p-nilpotence and solvability of finite groups

In this note, we first give some examples to show that some hypotheses of some well-known results for a group G to be p-nilpotent, solvable and supersolvable are essential and cannot be removed. Second, we give some generalizations of two theorems in [A. Ballester-Bolinches, X. Guo, Some results on p-nilpotence and solubility of finite groups, J. Algebra 228 (2000) 491–496].     

A condition for the solvability of finite groups

A subgroup H is called ?-supplemented in a finite group G, if there exists a subgroup B of G such that G = HB and H ₁ B is a proper subgroup of G for every maximal subgroup H ₁ of H. We investigate the influence of ?-supplementation of Sylow subgroups and obtain a condition for solvability and p-supersolvability of finite groups.