×

On weakly \(s\)-permutably embedded subgroups of finite groups. (English) Zbl 1177.20036

All groups considered are finite. Many authors have investigated the influence of some subgroups with certain embedding properties close to normality on the structure of the group. The paper under review is another contribution in this context. The authors introduce the following concept: a subgroup \(H\) of a group \(G\) is called weakly \(s\)-permutably embedded in \(G\) if there is a subnormal subgroup \(T\) of \(G\) and an \(s\)-permutably embedded subgroup \(H_{se}\) of \(G\) contained in \(H\) such that \(G=HT\) and \(H\cap T\leq H_{se}\). Following A. Ballester-Bolinches and M. C. Pedraza-Aguilera [in J. Pure Appl. Algebra 127, No. 2, 113-118 (1998; Zbl 0928.20020)], a subgroup \(H\) of \(G\) is said to be \(s\)-permutably embedded in \(G\) if every Sylow subgroup of \(H\) is a Sylow subgroup of some \(s\)-permutable (i.e., permutable with all Sylow subgroups) subgroup of \(G\). Clearly every \(s\)-permutably embedded subgroup is weakly \(s\)-permutably embedded. Moreover, weakly \(s\)-permutably embedding property also covers properly weakly \(s\)-permutability introduced by A. N. Skiba [in J. Algebra 315, No. 1, 192-209 (2007; Zbl 1130.20019)]: A subgroup \(H\) of a group \(G\) is weakly \(s\)-permutable in \(G\) if there is a subnormal subgroup \(T\) of \(G\) such that \(G=HT\) and \(H\cap T\leq H_{sG}\), where \(H_{sG}\) is the largest \(s\)-permutable subgroup of \(G\) contained in \(H\).
For a \(p\)-subgroup \(P\) of \(G\), \(p\) a prime number, the authors say that \(P\) satisfies \(\Delta_1\) in \(G\) if: \(P\) has a subgroup \(D\) such that \(1<|D|<|P|\) and all subgroups \(H\) of \(P\) with \(|H|=|D|\) are weakly \(s\)-permutably embedded in \(G\). When \(p=2\) and \(|P:D|>2\), in addition, \(H\) is weakly \(s\)-permutably embedded in \(G\) if there exists \(D_1\triangleleft H\leq P\) with \(2|D_1|=|D|\) and \(H/D_1\) is cyclic of order 4.
The main results in the paper are the following: Theorem 3.2. Let \(G\) be a group and \(P\) a Sylow \(p\)-subgroup of \(G\), where \(p\) is the smallest prime dividing \(|G|\). If \(P\) satisfies \(\Delta_1\) in \(G\), then \(G\) is \(p\)-nilpotent.
Theorem 3.5. Let \(\mathcal F\) be a saturated formation containing \(\mathcal U\), the class of all supersoluble groups, and \(G\) a group with a normal subgroup \(E\) such that \(G/E\in\mathcal F\). If every noncyclic Sylow subgroup of \(F^*(E)\) (the generalized Fitting subgroup of \(E\)) satisfies \(\Delta_1\) in \(G\), then \(G\in\mathcal F\).
A number of published results appear then as corollaries of these theorems.

MSC:

20D40 Products of subgroups of abstract finite groups
20D20 Sylow subgroups, Sylow properties, \(\pi\)-groups, \(\pi\)-structure
20D35 Subnormal subgroups of abstract finite groups
20D10 Finite solvable groups, theory of formations, Schunck classes, Fitting classes, \(\pi\)-length, ranks
20D15 Finite nilpotent groups, \(p\)-groups
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Assad M., J. Pure Appl. Algebra 165 pp 129– (2001) · Zbl 1011.20019
[2] Ballester-Bolinches A., J. Pure Appl. Algebra 127 pp 113– (1998) · Zbl 0928.20020
[3] Doerk K., Finite Soluble Groups (1992) · Zbl 0753.20001
[4] Huppert B., Endliche Gruppen I (1967) · Zbl 0217.07201
[5] Huppert B., Finite Groups III (1982) · Zbl 0514.20002
[6] Kegel O. H., Math. Z. 78 pp 205– (1962) · Zbl 0102.26802
[7] Li S., Czech. Math. J. 58 pp 1083– (2008) · Zbl 1166.20013
[8] Li Y., J. Algebra 281 pp 109– (2004) · Zbl 1079.20026
[9] Li Y., Acta Math. Hungar. 108 pp 283– (2005) · Zbl 1094.20007
[10] Skiba A. N., J. Algebra 315 pp 192– (2007) · Zbl 1130.20019
[11] Wang Y., J. Algebra 180 pp 954– (1996) · Zbl 0847.20010
[12] Wei H., J. Group Theory 10 pp 211– (2007) · Zbl 1125.20011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.