Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Notes on Finite Groups with Nearly S-permutable and Nearly S-permutable-Transitive Subgroups

View through CrossRef
Let G be a finite group and let H be a subgroup of G. We called H is nearly S-permutable in G if for every prime p such that (p, |H|) =1 and every subgroup K of G containing H the normalizer NK(H) contains some Sylow p-subgroup of K. We shall denoted this by (H is NSP in G). We introduce the class of NSPT-groups as those groups in which nearly S-permutability is transitive among subgroups. Specifically, if A is NSP in B  and  B is NSP in G, then A is NSP in G. In this paper we study certain finite groups characterized by NSP and NSPT properties and we also compare specific subgroups with groups under study, supported by theorems and examples.
Title: Notes on Finite Groups with Nearly S-permutable and Nearly S-permutable-Transitive Subgroups
Description:
Let G be a finite group and let H be a subgroup of G.
We called H is nearly S-permutable in G if for every prime p such that (p, |H|) =1 and every subgroup K of G containing H the normalizer NK(H) contains some Sylow p-subgroup of K.
We shall denoted this by (H is NSP in G).
We introduce the class of NSPT-groups as those groups in which nearly S-permutability is transitive among subgroups.
Specifically, if A is NSP in B  and  B is NSP in G, then A is NSP in G.
In this paper we study certain finite groups characterized by NSP and NSPT properties and we also compare specific subgroups with groups under study, supported by theorems and examples.

Related Results

On Weakly Conjugate ζ-Permutable Subgroups of Finite Groups
On Weakly Conjugate ζ-Permutable Subgroups of Finite Groups
Let C ≠ϕ be subset of G and ζ represents complete set of Sylow subgroups of G. Let Ԋ ≤ G is C- ζ permutable (conjugate ζ permutable) subgroup within G if for ԊxGq= GqԊx ∃ x∈C, ∀ Gq...
Algebraic and algorithmic aspects of Zm × Fn : fixed subgroups and quantification of inertia
Algebraic and algorithmic aspects of Zm × Fn : fixed subgroups and quantification of inertia
This work is based on the family of groups Z^m x F_n, namely free-abelian times free groups, direct products of finitely many copies of Z and a finitely generated free group F_n. T...
On weakly ????-permutable subgroups of finite groups
On weakly ????-permutable subgroups of finite groups
Abstract Let σ = {σi ∣i ∈ I} be some partition of the set of all primes ℙ, G be a finite group and σ(G) = {σi ∣σi ...
Directed Transitive Signature on Directed Tree
Directed Transitive Signature on Directed Tree
In early 2000's, Rivest [1,2] and Micali [2] introduced the notion of transitive signature, which allows a third party with public key to generate a valid signature for a composed ...
Transitive Deficiency One Parallelisms of PG(3, 7)
Transitive Deficiency One Parallelisms of PG(3, 7)
Consider the n-dimensional projective space PG(n,q) over a finite field with q elements. A spread in PG(n,q) is a set of lines which partition the point set. A parallelism is a par...
Ergativity
Ergativity
Ergativity refers to a system of marking grammatical relations in which intransitive subjects pattern together with transitive objects (“absolutive”), and differently from transiti...
Antipassive derivation in Soninke (West Mande)
Antipassive derivation in Soninke (West Mande)
Abstract Soninke, a West Mande language spoken in Mali, Mauritania, Gambia, and Senegal, provides crucial support to the...

Back to Top