Search results for "Permutable"
showing 10 items of 28 documents
Finite groups which are products of pairwise totally permutable subgroups
1998
Finite groups which are products of pairwise totally permutable subgroups are studied in this paper. The -residual, -projectors and -normalizers in such groups are obtained from the corresponding subgroups of the factor subgroups under suitable hypotheses.
Permutable products of supersoluble groups
2004
We investigate the structure of finite groups that are the mutually permutable product of two supersoluble groups. We show that the supersoluble residual is nilpotent and the Fitting quotient group is metabelian. These results are consequences of our main theorem, which states that such a product is supersoluble when the intersection of the two factors is core-free in the group.
Sylow permutable subnormal subgroups of finite groups
2002
[EN] An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgroup is permutable and Sylow permutable.
Some subgroup embeddings in finite groups: A mini review
2015
[EN] In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied. ª 2014 Production and hosting by Elsevier B.V. on behalf of Cairo University
A note on a result of Guo and Isaacs about p-supersolubility of finite groups
2016
In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.
On the supersoluble hypercentre of a finite group
2016
[EN] We give some sufficient conditions for a normal p-subgroup P of a finite group G to have every G-chief factor below it cyclic. The S-permutability of some p-subgroups of O^p(G)plays an important role. Some known results can be reproved and some others appear as corollaries of our main theorems.
On self-normalising subgroups of finite groups
2010
[EN] The aim of this paper is to characterise the classes of groups in which every subnormal subgroup is normal, permutable, or S-permutable by the embedding of the subgroups (respectively, subgroups of prime power order) in their normal, permutable, or S-permutable closure, respectively.
THE STRUCTURE OF MUTUALLY PERMUTABLE PRODUCTS OF FINITE NILPOTENT GROUPS
2007
We consider mutually permutable products G = AB of two nilpotent groups. The structure of the Sylow p-subgroups of its nilpotent residual is described.
Finite Soluble Groups with Permutable Subnormal Subgroups
2001
Abstract A finite group G is said to be a PST -group if every subnormal subgroup of G permutes with every Sylow subgroup of G . We shall discuss the normal structure of soluble PST -groups, mainly defining a local version of this concept. A deep study of the local structure turns out to be crucial for obtaining information about the global property. Moreover, a new approach to soluble PT -groups, i.e., soluble groups in which permutability is a transitive relation, follows naturally from our vision of PST -groups. Our techniques and results provide a unified point of view for T -groups, PT -groups, and PST -groups in the soluble universe, showing that the difference between these classes is…
Algorithms for permutability in finite groups
2013
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.